发布求助
文献互助 智能选刊 最新文献

Mathematical Programming Computation最新文献

筛选
英文 中文
On the generation of metric TSP instances with a large integrality gap by branch-and-cut 基于分支分割的大完整性缺口度量TSP实例生成研究
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2021-09-06 DOI: 10.1007/s12532-023-00235-7
Eleonora Vercesi, Stefano Gualandi, M. Mastrolilli, L. Gambardella
{"title":"On the generation of metric TSP instances with a large integrality gap by branch-and-cut","authors":"Eleonora Vercesi, Stefano Gualandi, M. Mastrolilli, L. Gambardella","doi":"10.1007/s12532-023-00235-7","DOIUrl":"https://doi.org/10.1007/s12532-023-00235-7","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"124 1","pages":"389-416"},"PeriodicalIF":6.3,"publicationDate":"2021-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80206360","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Performance enhancements for a generic conic interior point algorithm 一种通用的二次曲线内点算法的性能增强
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2021-07-09 DOI: 10.1007/s12532-022-00226-0
Christopher T. Coey, L. Kapelevich, J. Vielma
{"title":"Performance enhancements for a generic conic interior point algorithm","authors":"Christopher T. Coey, L. Kapelevich, J. Vielma","doi":"10.1007/s12532-022-00226-0","DOIUrl":"https://doi.org/10.1007/s12532-022-00226-0","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"1 1","pages":"53-101"},"PeriodicalIF":6.3,"publicationDate":"2021-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77715387","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Optimal patchings for consecutive ones matrices 连续1矩阵的最优补片
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2021-06-07 DOI: 10.1007/s12532-021-00203-z
M. Pfetsch, G. Rinaldi, P. Ventura
{"title":"Optimal patchings for consecutive ones matrices","authors":"M. Pfetsch, G. Rinaldi, P. Ventura","doi":"10.1007/s12532-021-00203-z","DOIUrl":"https://doi.org/10.1007/s12532-021-00203-z","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"22 1","pages":"43 - 84"},"PeriodicalIF":6.3,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85831644","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Allocation of fungible resources via a fast, scalable price discovery method 通过快速、可扩展的价格发现方法分配可替代资源
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2021-04-01 DOI: 10.1007/s12532-022-00220-6
Akshay Agrawal, S. Boyd, D. Narayanan, Fiodar Kazhamiaka, M. Zaharia
{"title":"Allocation of fungible resources via a fast, scalable price discovery method","authors":"Akshay Agrawal, S. Boyd, D. Narayanan, Fiodar Kazhamiaka, M. Zaharia","doi":"10.1007/s12532-022-00220-6","DOIUrl":"https://doi.org/10.1007/s12532-022-00220-6","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"59 1","pages":"593 - 622"},"PeriodicalIF":6.3,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91007842","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
A computational study of perspective cuts 透视切割的计算研究
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2021-03-17 DOI: 10.1007/s12532-023-00246-4
Ksenia Bestuzheva, A. Gleixner, Stefan Vigerske
{"title":"A computational study of perspective cuts","authors":"Ksenia Bestuzheva, A. Gleixner, Stefan Vigerske","doi":"10.1007/s12532-023-00246-4","DOIUrl":"https://doi.org/10.1007/s12532-023-00246-4","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"10 1","pages":"703 - 731"},"PeriodicalIF":6.3,"publicationDate":"2021-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87641991","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Computational aspects of infeasibility analysis in mixed integer programming 混合整数规划中不可行性分析的计算方法
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2021-03-06 DOI: 10.1007/s12532-021-00202-0
Jakob Witzig, Timo Berthold, Stefan Heinz
{"title":"Computational aspects of infeasibility analysis in mixed integer programming","authors":"Jakob Witzig, Timo Berthold, Stefan Heinz","doi":"10.1007/s12532-021-00202-0","DOIUrl":"https://doi.org/10.1007/s12532-021-00202-0","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"43 1","pages":"753 - 785"},"PeriodicalIF":6.3,"publicationDate":"2021-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73365870","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Publisher Correction to: Signomial and polynomial optimization via relative entropy and partial dualization 发布者更正:通过相对熵和部分二元化的信号和多项式优化
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2021-02-09 DOI: 10.1007/s12532-021-00201-1
Riley Murray, V. Chandrasekaran, A. Wierman
{"title":"Publisher Correction to: Signomial and polynomial optimization via relative entropy and partial dualization","authors":"Riley Murray, V. Chandrasekaran, A. Wierman","doi":"10.1007/s12532-021-00201-1","DOIUrl":"https://doi.org/10.1007/s12532-021-00201-1","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"47 1","pages":"297 - 299"},"PeriodicalIF":6.3,"publicationDate":"2021-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75157694","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
MiniCP: a lightweight solver for constraint programming MiniCP:用于约束规划的轻量级求解器
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2021-02-05 DOI: 10.1007/s12532-020-00190-7
Pascal Van Hentenryck
{"title":"MiniCP: a lightweight solver for constraint programming","authors":"Pascal Van Hentenryck","doi":"10.1007/s12532-020-00190-7","DOIUrl":"https://doi.org/10.1007/s12532-020-00190-7","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"22 1","pages":"133-184"},"PeriodicalIF":6.3,"publicationDate":"2021-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83861711","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 21
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library MIPLIB 2017:第6个混合整数编程库的数据驱动编译
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2021-01-07 DOI: 10.1007/s12532-020-00194-3
A. Gleixner, Gregor Hendel, Gerald Gamrath, Tobias Achterberg, Michael Bastubbe, Timo Berthold, Philipp M. Christophel, Kati Jarck, T. Koch, Jeff T. Linderoth, M. Lübbecke, H. Mittelmann, Derya Ozyurt, T. Ralphs, Domenico Salvagnin, Y. Shinano
{"title":"MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library","authors":"A. Gleixner, Gregor Hendel, Gerald Gamrath, Tobias Achterberg, Michael Bastubbe, Timo Berthold, Philipp M. Christophel, Kati Jarck, T. Koch, Jeff T. Linderoth, M. Lübbecke, H. Mittelmann, Derya Ozyurt, T. Ralphs, Domenico Salvagnin, Y. Shinano","doi":"10.1007/s12532-020-00194-3","DOIUrl":"https://doi.org/10.1007/s12532-020-00194-3","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"43 1","pages":"443 - 490"},"PeriodicalIF":6.3,"publicationDate":"2021-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85825627","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 141
Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs 期望约束凸随机规划的自适应原对偶随机梯度法
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-12-29 DOI: 10.1007/s12532-021-00214-w
Yonggui Yan, Yangyang Xu
{"title":"Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs","authors":"Yonggui Yan, Yangyang Xu","doi":"10.1007/s12532-021-00214-w","DOIUrl":"https://doi.org/10.1007/s12532-021-00214-w","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"29 1","pages":"319 - 363"},"PeriodicalIF":6.3,"publicationDate":"2020-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82929286","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信