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

Mathematical Programming Computation最新文献

筛选
英文 中文
Structure-driven fix-and-propagate heuristics for mixed integer programming 混合整数规划中结构驱动的修复-传播启发式算法
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2019-04-06 DOI: 10.1007/s12532-019-00159-1
Gerald Gamrath, Timo Berthold, Stefan Heinz, Michael Winkler
{"title":"Structure-driven fix-and-propagate heuristics for mixed integer programming","authors":"Gerald Gamrath, Timo Berthold, Stefan Heinz, Michael Winkler","doi":"10.1007/s12532-019-00159-1","DOIUrl":"https://doi.org/10.1007/s12532-019-00159-1","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2019-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73215598","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}
引用次数: 9
OAR Lib: an open source arc routing library 一个开源的圆弧路由库
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2019-03-27 DOI: 10.1007/S12532-019-00155-5
Oliver Lum, B. Golden, E. Wasil
{"title":"OAR Lib: an open source arc routing library","authors":"Oliver Lum, B. Golden, E. Wasil","doi":"10.1007/S12532-019-00155-5","DOIUrl":"https://doi.org/10.1007/S12532-019-00155-5","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2019-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81667853","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
Solving equilibrium problems using extended mathematical programming 用扩展数学规划解决平衡问题
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2019-03-02 DOI: 10.1007/s12532-019-00156-4
Youngdae Kim, M. Ferris
{"title":"Solving equilibrium problems using extended mathematical programming","authors":"Youngdae Kim, M. Ferris","doi":"10.1007/s12532-019-00156-4","DOIUrl":"https://doi.org/10.1007/s12532-019-00156-4","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2019-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74771170","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}
引用次数: 17
Certifiably optimal sparse principal component analysis 可证明的最优稀疏主成分分析
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2019-01-01 DOI: 10.1007/s12532-018-0153-6
Lauren Berk, D. Bertsimas
{"title":"Certifiably optimal sparse principal component analysis","authors":"Lauren Berk, D. Bertsimas","doi":"10.1007/s12532-018-0153-6","DOIUrl":"https://doi.org/10.1007/s12532-018-0153-6","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74013271","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}
引用次数: 28
Adaptive large neighborhood search for mixed integer programming 混合整数规划的自适应大邻域搜索
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2018-12-18 DOI: 10.1007/s12532-021-00209-7
Gregor Hendel
{"title":"Adaptive large neighborhood search for mixed integer programming","authors":"Gregor Hendel","doi":"10.1007/s12532-021-00209-7","DOIUrl":"https://doi.org/10.1007/s12532-021-00209-7","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2018-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80802270","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}
引用次数: 25
A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs 近似机会约束非线性规划有效边界的随机逼近方法
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2018-12-17 DOI: 10.1007/s12532-020-00199-y
R. Kannan, James R. Luedtke
{"title":"A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs","authors":"R. Kannan, James R. Luedtke","doi":"10.1007/s12532-020-00199-y","DOIUrl":"https://doi.org/10.1007/s12532-020-00199-y","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2018-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90006973","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
Optimizing over pure stationary equilibria in consensus stopping games 共识停止对策中纯平稳均衡的优化
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2018-11-02 DOI: 10.1007/s12532-018-0151-8
Amin Dehghanian, Murat Kurt, A. Schaefer
{"title":"Optimizing over pure stationary equilibria in consensus stopping games","authors":"Amin Dehghanian, Murat Kurt, A. Schaefer","doi":"10.1007/s12532-018-0151-8","DOIUrl":"https://doi.org/10.1007/s12532-018-0151-8","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2018-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73403594","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
Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem 交流最优潮流问题的矩阵小重构和基于sopp的空间分切法
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2018-10-04 DOI: 10.1007/s12532-018-0150-9
Burak Kocuk, Santanu S. Dey, X. A. Sun
{"title":"Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem","authors":"Burak Kocuk, Santanu S. Dey, X. A. Sun","doi":"10.1007/s12532-018-0150-9","DOIUrl":"https://doi.org/10.1007/s12532-018-0150-9","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2018-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72798133","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}
引用次数: 55
Solving linear programs with complementarity constraints using branch-and-cut 用分支割法求解具有互补约束的线性规划
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2018-09-27 DOI: 10.1007/s12532-018-0149-2
Bin Yu, J. Mitchell, J. Pang
{"title":"Solving linear programs with complementarity constraints using branch-and-cut","authors":"Bin Yu, J. Mitchell, J. Pang","doi":"10.1007/s12532-018-0149-2","DOIUrl":"https://doi.org/10.1007/s12532-018-0149-2","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2018-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74872022","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}
引用次数: 14
QPLIB: a library of quadratic programming instances 二次规划实例库
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2018-09-22 DOI: 10.1007/s12532-018-0147-4
Fabio Furini, Emiliano Traversi, P. Belotti, A. Frangioni, A. Gleixner, Nick Gould, Leo Liberti, Andrea Lodi, R. Misener, H. Mittelmann, N. Sahinidis, Stefan Vigerske, Angelika Wiegele
{"title":"QPLIB: a library of quadratic programming instances","authors":"Fabio Furini, Emiliano Traversi, P. Belotti, A. Frangioni, A. Gleixner, Nick Gould, Leo Liberti, Andrea Lodi, R. Misener, H. Mittelmann, N. Sahinidis, Stefan Vigerske, Angelika Wiegele","doi":"10.1007/s12532-018-0147-4","DOIUrl":"https://doi.org/10.1007/s12532-018-0147-4","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":null,"pages":null},"PeriodicalIF":6.3,"publicationDate":"2018-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91168902","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}
引用次数: 65
首页 上一页 下一页 尾页
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学术官方微信