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

Mathematical Programming Computation最新文献

筛选
英文 中文
Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations 解决稀疏图上的图划分:切割，投影和扩展公式
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2022-11-07 DOI: 10.1007/s12532-022-00228-y
Demetrios V. Papazaharias, J. Walteros
{"title":"Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations","authors":"Demetrios V. Papazaharias, J. Walteros","doi":"10.1007/s12532-022-00228-y","DOIUrl":"https://doi.org/10.1007/s12532-022-00228-y","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"45 1","pages":"103-151"},"PeriodicalIF":6.3,"publicationDate":"2022-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74005234","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}
引用次数: 0
A data driven Dantzig–Wolfe decomposition framework 数据驱动的dantzigg - wolfe分解框架
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2022-11-02 DOI: 10.1007/s12532-022-00230-4
S. Basso, A. Ceselli
{"title":"A data driven Dantzig–Wolfe decomposition framework","authors":"S. Basso, A. Ceselli","doi":"10.1007/s12532-022-00230-4","DOIUrl":"https://doi.org/10.1007/s12532-022-00230-4","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"1 1","pages":"153-194"},"PeriodicalIF":6.3,"publicationDate":"2022-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83670304","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
On technical debt in mathematical programming: An exploratory study 数学规划中的技术债:探索性研究
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2022-08-05 DOI: 10.1007/s12532-022-00225-1
M. Vidoni, Maria Laura Cunico
{"title":"On technical debt in mathematical programming: An exploratory study","authors":"M. Vidoni, Maria Laura Cunico","doi":"10.1007/s12532-022-00225-1","DOIUrl":"https://doi.org/10.1007/s12532-022-00225-1","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"17 1","pages":"781 - 818"},"PeriodicalIF":6.3,"publicationDate":"2022-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81544171","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}
引用次数: 0
Structure-aware methods for expensive derivative-free nonsmooth composite optimization 无昂贵导数非光滑复合材料优化的结构感知方法
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2022-07-17 DOI: 10.1007/s12532-023-00245-5
Jeffrey Larson, M. Menickelly
{"title":"Structure-aware methods for expensive derivative-free nonsmooth composite optimization","authors":"Jeffrey Larson, M. Menickelly","doi":"10.1007/s12532-023-00245-5","DOIUrl":"https://doi.org/10.1007/s12532-023-00245-5","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"10 1","pages":""},"PeriodicalIF":6.3,"publicationDate":"2022-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83934913","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
Enhanced formulation for the Guillotine 2D Cutting Knapsack Problem 改进的割刀二维切割背包问题的公式
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2022-07-12 DOI: 10.1007/s12532-022-00222-4
H. Becker, O. Araújo, L. Buriol
{"title":"Enhanced formulation for the Guillotine 2D Cutting Knapsack Problem","authors":"H. Becker, O. Araújo, L. Buriol","doi":"10.1007/s12532-022-00222-4","DOIUrl":"https://doi.org/10.1007/s12532-022-00222-4","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"410 1","pages":"673 - 697"},"PeriodicalIF":6.3,"publicationDate":"2022-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80126826","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
An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem 有能力车辆路径问题的集成局部搜索/集划分改进启发式算法
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2022-07-02 DOI: 10.1007/s12532-022-00224-2
F. Cavaliere, Emilio Bendotti, M. Fischetti
{"title":"An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem","authors":"F. Cavaliere, Emilio Bendotti, M. Fischetti","doi":"10.1007/s12532-022-00224-2","DOIUrl":"https://doi.org/10.1007/s12532-022-00224-2","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"27 1","pages":"749 - 779"},"PeriodicalIF":6.3,"publicationDate":"2022-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88272281","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}
引用次数: 0
JuMP 1.0: recent improvements to a modeling language for mathematical optimization JuMP 1.0:对数学优化建模语言的最新改进
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2022-06-01 DOI: 10.1007/s12532-023-00239-3
Miles Lubin, O. Dowson, J. Garcia, Joey Huchette, B. Legat, J. Vielma
{"title":"JuMP 1.0: recent improvements to a modeling language for mathematical optimization","authors":"Miles Lubin, O. Dowson, J. Garcia, Joey Huchette, B. Legat, J. Vielma","doi":"10.1007/s12532-023-00239-3","DOIUrl":"https://doi.org/10.1007/s12532-023-00239-3","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"66 1","pages":"581 - 589"},"PeriodicalIF":6.3,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89562810","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}
引用次数: 33
Political districting to minimize cut edges 政治上的划分以尽量减少分歧
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2022-04-26 DOI: 10.1007/s12532-022-00221-5
Hamidreza Validi, Austin Buchanan
{"title":"Political districting to minimize cut edges","authors":"Hamidreza Validi, Austin Buchanan","doi":"10.1007/s12532-022-00221-5","DOIUrl":"https://doi.org/10.1007/s12532-022-00221-5","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"219 1","pages":"623 - 672"},"PeriodicalIF":6.3,"publicationDate":"2022-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89116046","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}
引用次数: 13
Limited-memory common-directions method for large-scale optimization: convergence, parallelization, and distributed optimization 大规模优化的有限内存共方向方法:收敛、并行化和分布式优化
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2022-03-29 DOI: 10.1007/s12532-022-00219-z
Ching-pei Lee, Po-Wei Wang, Chih-Jen Lin
{"title":"Limited-memory common-directions method for large-scale optimization: convergence, parallelization, and distributed optimization","authors":"Ching-pei Lee, Po-Wei Wang, Chih-Jen Lin","doi":"10.1007/s12532-022-00219-z","DOIUrl":"https://doi.org/10.1007/s12532-022-00219-z","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"48 9","pages":"543 - 591"},"PeriodicalIF":6.3,"publicationDate":"2022-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72576581","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}
引用次数: 2
Efficient MIP techniques for computing the relaxation complexity 计算松弛复杂度的高效MIP技术
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2022-03-10 DOI: 10.1007/s12532-023-00241-9
G. Averkov, Christopher Hojny, Matthias Schymura
{"title":"Efficient MIP techniques for computing the relaxation complexity","authors":"G. Averkov, Christopher Hojny, Matthias Schymura","doi":"10.1007/s12532-023-00241-9","DOIUrl":"https://doi.org/10.1007/s12532-023-00241-9","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"3 1","pages":"1-32"},"PeriodicalIF":6.3,"publicationDate":"2022-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89554172","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
首页 上一页 下一页 尾页
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学术官方微信