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

Mathematical Programming Computation最新文献

筛选
英文 中文
CP-Lib: Benchmark Instances of the Clique Partitioning Problem CP-Lib: Clique Partitioning问题的基准测试实例
1区 数学
Mathematical Programming Computation Pub Date : 2023-11-03 DOI: 10.1007/s12532-023-00249-1
Michael M. Sørensen, Adam N. Letchford
{"title":"CP-Lib: Benchmark Instances of the Clique Partitioning Problem","authors":"Michael M. Sørensen, Adam N. Letchford","doi":"10.1007/s12532-023-00249-1","DOIUrl":"https://doi.org/10.1007/s12532-023-00249-1","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135868368","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
Self-adaptive ADMM for semi-strongly convex problems 半强凸问题的自适应ADMM
1区 数学
Mathematical Programming Computation Pub Date : 2023-10-27 DOI: 10.1007/s12532-023-00250-8
Tianyun Tang, Kim-Chuan Toh
{"title":"Self-adaptive ADMM for semi-strongly convex problems","authors":"Tianyun Tang, Kim-Chuan Toh","doi":"10.1007/s12532-023-00250-8","DOIUrl":"https://doi.org/10.1007/s12532-023-00250-8","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"42 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136234759","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
Domain-Driven Solver (DDS) Version 2.1: a MATLAB-based software package for convex optimization problems in domain-driven form Domain-Driven Solver (DDS) Version 2.1:一个基于matlab的软件包，用于解决领域驱动形式的凸优化问题
1区 数学
Mathematical Programming Computation Pub Date : 2023-10-21 DOI: 10.1007/s12532-023-00248-2
Mehdi Karimi, Levent Tunçel
{"title":"Domain-Driven Solver (DDS) Version 2.1: a MATLAB-based software package for convex optimization problems in domain-driven form","authors":"Mehdi Karimi, Levent Tunçel","doi":"10.1007/s12532-023-00248-2","DOIUrl":"https://doi.org/10.1007/s12532-023-00248-2","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"117 7-8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135511881","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}
引用次数: 12
A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty 不确定条件下大规模场景优化的轮辐并行系统
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2023-08-14 DOI: 10.1007/s12532-023-00247-3
Bernard Knueven, David T. Mildebrath, Christopher Muir, John D. Siirola, J. Watson, D. L. Woodruff
{"title":"A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty","authors":"Bernard Knueven, David T. Mildebrath, Christopher Muir, John D. Siirola, J. Watson, D. L. Woodruff","doi":"10.1007/s12532-023-00247-3","DOIUrl":"https://doi.org/10.1007/s12532-023-00247-3","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"35 1","pages":"591 - 619"},"PeriodicalIF":6.3,"publicationDate":"2023-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78372412","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
Exact methods for discrete Γdocumentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$${varGamma }$$end{document}-robust interd Exact methods for discrete Γdocumentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$${varGamma }$$end{document}-robust interd
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2023-07-10 DOI: 10.1007/s12532-023-00244-6
Yasmine Beck, Ivana Ljubić, Martin Schmidt
{"title":"Exact methods for discrete Γdocumentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$${varGamma }$$end{document}-robust interd","authors":"Yasmine Beck, Ivana Ljubić, Martin Schmidt","doi":"10.1007/s12532-023-00244-6","DOIUrl":"https://doi.org/10.1007/s12532-023-00244-6","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"232 1","pages":"733 - 782"},"PeriodicalIF":6.3,"publicationDate":"2023-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89050628","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
Computing minimum-volume enclosing ellipsoids 计算最小体积封闭椭球体
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2023-05-20 DOI: 10.1007/s12532-023-00242-8
Nathaniel Bowman, Michael T. Heath
{"title":"Computing minimum-volume enclosing ellipsoids","authors":"Nathaniel Bowman, Michael T. Heath","doi":"10.1007/s12532-023-00242-8","DOIUrl":"https://doi.org/10.1007/s12532-023-00242-8","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"3 1","pages":"621 - 650"},"PeriodicalIF":6.3,"publicationDate":"2023-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89241145","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
Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems 整数规划列生成:使用一种新的定价方案加速branch-and-price，以寻找集覆盖、打包和划分问题的高质量解决方案
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2023-04-25 DOI: 10.1007/s12532-023-00240-w
Stephen J. Maher, Elina Rönnberg
{"title":"Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems","authors":"Stephen J. Maher, Elina Rönnberg","doi":"10.1007/s12532-023-00240-w","DOIUrl":"https://doi.org/10.1007/s12532-023-00240-w","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"14 1","pages":"1-40"},"PeriodicalIF":6.3,"publicationDate":"2023-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80980553","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
Feasibility Jump: an LP-free Lagrangian MIP heuristic 可行性跳跃:无lp的拉格朗日MIP启发式
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2023-03-14 DOI: 10.1007/s12532-023-00234-8
Bjørnar Luteberget, Giorgio Sartor
{"title":"Feasibility Jump: an LP-free Lagrangian MIP heuristic","authors":"Bjørnar Luteberget, Giorgio Sartor","doi":"10.1007/s12532-023-00234-8","DOIUrl":"https://doi.org/10.1007/s12532-023-00234-8","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"1 1","pages":"365-388"},"PeriodicalIF":6.3,"publicationDate":"2023-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89976500","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 branch and bound algorithm for robust binary optimization with budget uncertainty 预算不确定鲁棒二值优化的分支定界算法
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2023-01-23 DOI: 10.1007/s12532-022-00232-2
Christina Büsing, Timo Gersing, A. Koster
{"title":"A branch and bound algorithm for robust binary optimization with budget uncertainty","authors":"Christina Büsing, Timo Gersing, A. Koster","doi":"10.1007/s12532-022-00232-2","DOIUrl":"https://doi.org/10.1007/s12532-022-00232-2","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"12 1","pages":"269-326"},"PeriodicalIF":6.3,"publicationDate":"2023-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77848007","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
Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds 具有k-最优追随者的混合整数双层优化:界的层次结构
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2022-12-08 DOI: 10.1007/s12532-022-00227-z
Xueyu Shi, O. Prokopyev, T. Ralphs
{"title":"Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds","authors":"Xueyu Shi, O. Prokopyev, T. Ralphs","doi":"10.1007/s12532-022-00227-z","DOIUrl":"https://doi.org/10.1007/s12532-022-00227-z","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"214 1","pages":"1-51"},"PeriodicalIF":6.3,"publicationDate":"2022-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73677350","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学术官方微信