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

Mathematical Programming Computation最新文献

筛选
英文 中文
A triangulation and fill-reducing initialization procedure for the simplex algorithm 单纯形算法的三角剖分和减少填充初始化程序
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-06-26 DOI: 10.1007/s12532-020-00188-1
N. Ploskas, N. Sahinidis, N. Samaras
{"title":"A triangulation and fill-reducing initialization procedure for the simplex algorithm","authors":"N. Ploskas, N. Sahinidis, N. Samaras","doi":"10.1007/s12532-020-00188-1","DOIUrl":"https://doi.org/10.1007/s12532-020-00188-1","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"86 1","pages":"491 - 508"},"PeriodicalIF":6.3,"publicationDate":"2020-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76217144","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
A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes 具有随机物品大小的动态背包问题的列约束生成算法
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-06-26 DOI: 10.1007/s12532-020-00189-0
Daniel Blado, A. Toriello
{"title":"A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes","authors":"Daniel Blado, A. Toriello","doi":"10.1007/s12532-020-00189-0","DOIUrl":"https://doi.org/10.1007/s12532-020-00189-0","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"6 1","pages":"185 - 223"},"PeriodicalIF":6.3,"publicationDate":"2020-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73147459","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
Design and implementation of a modular interior-point solver for linear optimization 线性优化的模块化内点求解器的设计与实现
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-06-15 DOI: 10.1007/s12532-020-00200-8
Mathieu Tanneau, M. Anjos, Andrea Lodi
{"title":"Design and implementation of a modular interior-point solver for linear optimization","authors":"Mathieu Tanneau, M. Anjos, Andrea Lodi","doi":"10.1007/s12532-020-00200-8","DOIUrl":"https://doi.org/10.1007/s12532-020-00200-8","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"15 1","pages":"509 - 551"},"PeriodicalIF":6.3,"publicationDate":"2020-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84334297","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
A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl 用于优化的基于图的建模抽象:Plasmo.jl中的概念和实现
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-06-09 DOI: 10.1007/s12532-022-00223-3
Jordan Jalving, Sungho Shin, V. Zavala
{"title":"A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl","authors":"Jordan Jalving, Sungho Shin, V. Zavala","doi":"10.1007/s12532-022-00223-3","DOIUrl":"https://doi.org/10.1007/s12532-022-00223-3","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"11 1","pages":"699 - 747"},"PeriodicalIF":6.3,"publicationDate":"2020-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85666723","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
Deterministic global optimization with Gaussian processes embedded 嵌入高斯过程的确定性全局优化
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-05-21 DOI: 10.1007/s12532-021-00204-y
Artur M. Schweidtmann, D. Bongartz, D. Grothe, Tim Kerkenhoff, Xiaopeng Lin, J. Najman, A. Mitsos
{"title":"Deterministic global optimization with Gaussian processes embedded","authors":"Artur M. Schweidtmann, D. Bongartz, D. Grothe, Tim Kerkenhoff, Xiaopeng Lin, J. Najman, A. Mitsos","doi":"10.1007/s12532-021-00204-y","DOIUrl":"https://doi.org/10.1007/s12532-021-00204-y","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"22 1","pages":"553 - 581"},"PeriodicalIF":6.3,"publicationDate":"2020-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73259519","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}
引用次数: 23
Special issue forward: the 2018 Mixed Integer Programming workshop 特刊:2018混合整数规划研讨会
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-05-20 DOI: 10.1007/s12532-020-00187-2
D. Bienstock, G. Nannicini
{"title":"Special issue forward: the 2018 Mixed Integer Programming workshop","authors":"D. Bienstock, G. Nannicini","doi":"10.1007/s12532-020-00187-2","DOIUrl":"https://doi.org/10.1007/s12532-020-00187-2","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"435 1","pages":"131 - 131"},"PeriodicalIF":6.3,"publicationDate":"2020-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81666477","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
Mixed-integer programming techniques for the connected max-k-cut problem 连通max-k-cut问题的混合整数规划技术
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-04-30 DOI: 10.1007/s12532-020-00186-3
Christopher Hojny, Imke Joormann, Hendrik Lüthen, Martin Schmidt
{"title":"Mixed-integer programming techniques for the connected max-k-cut problem","authors":"Christopher Hojny, Imke Joormann, Hendrik Lüthen, Martin Schmidt","doi":"10.1007/s12532-020-00186-3","DOIUrl":"https://doi.org/10.1007/s12532-020-00186-3","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"100 1","pages":"75 - 132"},"PeriodicalIF":6.3,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76086431","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}
引用次数: 16
Asynchronous Lagrangian scenario decomposition 异步拉格朗日场景分解
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-03-14 DOI: 10.1007/s12532-020-00185-4
I. Aravena, A. Papavasiliou
{"title":"Asynchronous Lagrangian scenario decomposition","authors":"I. Aravena, A. Papavasiliou","doi":"10.1007/s12532-020-00185-4","DOIUrl":"https://doi.org/10.1007/s12532-020-00185-4","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"15 1","pages":"1 - 50"},"PeriodicalIF":6.3,"publicationDate":"2020-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78197351","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}
引用次数: 6
Split cuts from sparse disjunctions 从稀疏分割中分割
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-03-04 DOI: 10.1007/s12532-020-00180-9
Ricardo Fukasawa, Laurent Poirrier, Shenghao Yang
{"title":"Split cuts from sparse disjunctions","authors":"Ricardo Fukasawa, Laurent Poirrier, Shenghao Yang","doi":"10.1007/s12532-020-00180-9","DOIUrl":"https://doi.org/10.1007/s12532-020-00180-9","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"11 1","pages":"295 - 335"},"PeriodicalIF":6.3,"publicationDate":"2020-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86165197","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
A novel matching formulation for startup costs in unit commitment 一种新的机组承诺启动成本匹配公式
IF 6.3 1区 数学
Mathematical Programming Computation Pub Date : 2020-02-24 DOI: 10.1007/s12532-020-00176-5
Bernard Knueven, James Ostrowski, Jean-Paul Watson
{"title":"A novel matching formulation for startup costs in unit commitment","authors":"Bernard Knueven, James Ostrowski, Jean-Paul Watson","doi":"10.1007/s12532-020-00176-5","DOIUrl":"https://doi.org/10.1007/s12532-020-00176-5","url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":"94 1","pages":"225 - 248"},"PeriodicalIF":6.3,"publicationDate":"2020-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76859056","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学术官方微信