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

4or-A Quarterly Journal of Operations Research最新文献

筛选
英文 中文
Max–max, max–min, min–max and min–min knapsack problems with a parametric constraint 具有参数约束的最大-最大、最大-最小、最小-最大和最小-最小背包问题
IF 2 4区 管理学
4or-A Quarterly Journal of Operations Research Pub Date : 2022-04-27 DOI: 10.1007/s10288-022-00509-1
Nir Halman, M. Kovalyov, A. Quilliot
{"title":"Max–max, max–min, min–max and min–min knapsack problems with a parametric constraint","authors":"Nir Halman, M. Kovalyov, A. Quilliot","doi":"10.1007/s10288-022-00509-1","DOIUrl":"https://doi.org/10.1007/s10288-022-00509-1","url":null,"abstract":"","PeriodicalId":51846,"journal":{"name":"4or-A Quarterly Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85418379","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Empirical analysis of stochastic local search behaviour: connecting structure, components and landscape 随机局部搜索行为的实证分析:连接结构、构件和景观
IF 2 4区 管理学
4or-A Quarterly Journal of Operations Research Pub Date : 2022-04-26 DOI: 10.1007/s10288-022-00511-7
A. Franzin
{"title":"Empirical analysis of stochastic local search behaviour: connecting structure, components and landscape","authors":"A. Franzin","doi":"10.1007/s10288-022-00511-7","DOIUrl":"https://doi.org/10.1007/s10288-022-00511-7","url":null,"abstract":"","PeriodicalId":51846,"journal":{"name":"4or-A Quarterly Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82975827","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Constraint qualifications and optimality conditions for robust nonsmooth semi-infinite multiobjective optimization problems 鲁棒非光滑半无限多目标优化问题的约束条件和最优性条件
IF 2 4区 管理学
4or-A Quarterly Journal of Operations Research Pub Date : 2022-04-20 DOI: 10.1007/s10288-022-00506-4
N. M. Tung, M. Duy
{"title":"Constraint qualifications and optimality conditions for robust nonsmooth semi-infinite multiobjective optimization problems","authors":"N. M. Tung, M. Duy","doi":"10.1007/s10288-022-00506-4","DOIUrl":"https://doi.org/10.1007/s10288-022-00506-4","url":null,"abstract":"","PeriodicalId":51846,"journal":{"name":"4or-A Quarterly Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76590805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A decomposition based minimax regret approach for inverse multiple criteria sorting problem 逆多准则排序问题的一种基于分解的极大极小遗憾方法
IF 2 4区 管理学
4or-A Quarterly Journal of Operations Research Pub Date : 2022-04-07 DOI: 10.1007/s10288-022-00505-5
Ö. Özpeynirci, S. Özpeynirci, V. Mousseau
{"title":"A decomposition based minimax regret approach for inverse multiple criteria sorting problem","authors":"Ö. Özpeynirci, S. Özpeynirci, V. Mousseau","doi":"10.1007/s10288-022-00505-5","DOIUrl":"https://doi.org/10.1007/s10288-022-00505-5","url":null,"abstract":"","PeriodicalId":51846,"journal":{"name":"4or-A Quarterly Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87048674","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A branch and bound approach for the tower crane selection and positioning problem with respect to mutual interference 考虑相互干扰的塔机选择定位问题的分支定界法
IF 2 4区 管理学
4or-A Quarterly Journal of Operations Research Pub Date : 2022-02-24 DOI: 10.1007/s10288-022-00503-7
M. Dienstknecht
{"title":"A branch and bound approach for the tower crane selection and positioning problem with respect to mutual interference","authors":"M. Dienstknecht","doi":"10.1007/s10288-022-00503-7","DOIUrl":"https://doi.org/10.1007/s10288-022-00503-7","url":null,"abstract":"","PeriodicalId":51846,"journal":{"name":"4or-A Quarterly Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83772134","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Challenges and opportunities in crowdsourced delivery planning and operations 众包交付规划与运营的挑战与机遇
IF 2 4区 管理学
4or-A Quarterly Journal of Operations Research Pub Date : 2022-01-21 DOI: 10.1007/s10288-021-00500-2
M. Savelsbergh, M. Ulmer
{"title":"Challenges and opportunities in crowdsourced delivery planning and operations","authors":"M. Savelsbergh, M. Ulmer","doi":"10.1007/s10288-021-00500-2","DOIUrl":"https://doi.org/10.1007/s10288-021-00500-2","url":null,"abstract":"","PeriodicalId":51846,"journal":{"name":"4or-A Quarterly Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72603825","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
Multi-period distribution network problems with minimum commitment contracts 具有最小承诺合同的多周期配电网问题
IF 2 4区 管理学
4or-A Quarterly Journal of Operations Research Pub Date : 2022-01-01 DOI: 10.1007/s10288-022-00502-8
Christian Clavijo López
{"title":"Multi-period distribution network problems with minimum commitment contracts","authors":"Christian Clavijo López","doi":"10.1007/s10288-022-00502-8","DOIUrl":"https://doi.org/10.1007/s10288-022-00502-8","url":null,"abstract":"","PeriodicalId":51846,"journal":{"name":"4or-A Quarterly Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85610093","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A note on the complexity of the bilevel bottleneck assignment problem 关于双层瓶颈分配问题复杂性的说明
IF 2 4区 管理学
4or-A Quarterly Journal of Operations Research Pub Date : 2021-12-31 DOI: 10.1007/s10288-021-00499-6
Dennis Fischer, Komal Muluk, G. Woeginger
{"title":"A note on the complexity of the bilevel bottleneck assignment problem","authors":"Dennis Fischer, Komal Muluk, G. Woeginger","doi":"10.1007/s10288-021-00499-6","DOIUrl":"https://doi.org/10.1007/s10288-021-00499-6","url":null,"abstract":"","PeriodicalId":51846,"journal":{"name":"4or-A Quarterly Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2021-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83909599","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem 累积容量车辆路径问题的分支降价算法
IF 2 4区 管理学
4or-A Quarterly Journal of Operations Research Pub Date : 2021-11-26 DOI: 10.1007/s10288-021-00498-7
Caio Marinho Damião, J. M. Silva, Eduardo Uchoa
{"title":"A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem","authors":"Caio Marinho Damião, J. M. Silva, Eduardo Uchoa","doi":"10.1007/s10288-021-00498-7","DOIUrl":"https://doi.org/10.1007/s10288-021-00498-7","url":null,"abstract":"","PeriodicalId":51846,"journal":{"name":"4or-A Quarterly Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2021-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91350774","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
A study on sequential minimal optimization methods for standard quadratic problems 标准二次问题的序贯最小优化方法研究
IF 2 4区 管理学
4or-A Quarterly Journal of Operations Research Pub Date : 2021-11-11 DOI: 10.1007/s10288-021-00496-9
Riccardo Bisori, M. Lapucci, M. Sciandrone
{"title":"A study on sequential minimal optimization methods for standard quadratic problems","authors":"Riccardo Bisori, M. Lapucci, M. Sciandrone","doi":"10.1007/s10288-021-00496-9","DOIUrl":"https://doi.org/10.1007/s10288-021-00496-9","url":null,"abstract":"","PeriodicalId":51846,"journal":{"name":"4or-A Quarterly Journal of Operations Research","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2021-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78600797","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"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学术官方微信