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

Eur. J. Oper. Res.最新文献

筛选
英文 中文
A MILP model and two heuristics for the Bin Packing Problem with Conflicts and Item Fragmentation 具有冲突和物品碎片的装箱问题的一个MILP模型和两种启发式方法
Eur. J. Oper. Res. Pub Date : 2022-02-01 DOI: 10.1016/j.ejor.2022.02.014
Krzysztof Fleszar
{"title":"A MILP model and two heuristics for the Bin Packing Problem with Conflicts and Item Fragmentation","authors":"Krzysztof Fleszar","doi":"10.1016/j.ejor.2022.02.014","DOIUrl":"https://doi.org/10.1016/j.ejor.2022.02.014","url":null,"abstract":"","PeriodicalId":11868,"journal":{"name":"Eur. J. Oper. Res.","volume":"29 1","pages":"37-53"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81144185","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
A cutting plane method and a parallel algorithm for packing rectangles in a circular container 一种用于在圆形容器中包装矩形的切割平面方法及并行算法
Eur. J. Oper. Res. Pub Date : 2022-02-01 DOI: 10.1016/j.ejor.2022.02.023
Allyson Silva, Leandro C. Coelho, M. Darvish, J. Renaud
{"title":"A cutting plane method and a parallel algorithm for packing rectangles in a circular container","authors":"Allyson Silva, Leandro C. Coelho, M. Darvish, J. Renaud","doi":"10.1016/j.ejor.2022.02.023","DOIUrl":"https://doi.org/10.1016/j.ejor.2022.02.023","url":null,"abstract":"","PeriodicalId":11868,"journal":{"name":"Eur. J. Oper. Res.","volume":"30 1","pages":"114-128"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73557666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Competitive collection with convenience-perceived customers 有竞争力的收集与方便感知的客户
Eur. J. Oper. Res. Pub Date : 2022-02-01 DOI: 10.1016/j.ejor.2022.02.027
Qidong He, Nengmin Wang, Tyson R. Browning, Bin Jiang
{"title":"Competitive collection with convenience-perceived customers","authors":"Qidong He, Nengmin Wang, Tyson R. Browning, Bin Jiang","doi":"10.1016/j.ejor.2022.02.027","DOIUrl":"https://doi.org/10.1016/j.ejor.2022.02.027","url":null,"abstract":"","PeriodicalId":11868,"journal":{"name":"Eur. J. Oper. Res.","volume":"121 1","pages":"239-254"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73567791","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Upgrading edges in the maximal covering location problem 最大覆盖定位问题中的边升级
Eur. J. Oper. Res. Pub Date : 2022-02-01 DOI: 10.1016/j.ejor.2022.02.001
Marta Baldomero-Naranjo, J. Kalcsics, Alfredo Marín, A. M. Rodríguez-Chía
{"title":"Upgrading edges in the maximal covering location problem","authors":"Marta Baldomero-Naranjo, J. Kalcsics, Alfredo Marín, A. M. Rodríguez-Chía","doi":"10.1016/j.ejor.2022.02.001","DOIUrl":"https://doi.org/10.1016/j.ejor.2022.02.001","url":null,"abstract":"","PeriodicalId":11868,"journal":{"name":"Eur. J. Oper. Res.","volume":"23 1","pages":"14-36"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75055820","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Improving efficiency of service systems by performing a part of the service without the customer's presence 通过在客户不在场的情况下执行部分服务，提高服务系统的效率
Eur. J. Oper. Res. Pub Date : 2022-02-01 DOI: 10.1016/j.ejor.2022.01.045
Gabi Hanukov
{"title":"Improving efficiency of service systems by performing a part of the service without the customer's presence","authors":"Gabi Hanukov","doi":"10.1016/j.ejor.2022.01.045","DOIUrl":"https://doi.org/10.1016/j.ejor.2022.01.045","url":null,"abstract":"","PeriodicalId":11868,"journal":{"name":"Eur. J. Oper. Res.","volume":"14 1","pages":"606-620"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82922686","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work 单台机器调度与共同分配的截止日期/截止窗口，以尽量减少总加权早，晚的工作
Eur. J. Oper. Res. Pub Date : 2022-02-01 DOI: 10.1016/j.ejor.2022.02.017
D. Shabtay, G. Mosheiov, Daniel Oron
{"title":"Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work","authors":"D. Shabtay, G. Mosheiov, Daniel Oron","doi":"10.1016/j.ejor.2022.02.017","DOIUrl":"https://doi.org/10.1016/j.ejor.2022.02.017","url":null,"abstract":"","PeriodicalId":11868,"journal":{"name":"Eur. J. Oper. Res.","volume":"60 1","pages":"66-77"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90854456","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Channel choice and incentives in the cadaveric organ supply chain 尸体器官供应链中的渠道选择与激励
Eur. J. Oper. Res. Pub Date : 2022-02-01 DOI: 10.1016/j.ejor.2022.01.041
A. Misra, H. Saranga, Rajeev R. Tripathi
{"title":"Channel choice and incentives in the cadaveric organ supply chain","authors":"A. Misra, H. Saranga, Rajeev R. Tripathi","doi":"10.1016/j.ejor.2022.01.041","DOIUrl":"https://doi.org/10.1016/j.ejor.2022.01.041","url":null,"abstract":"","PeriodicalId":11868,"journal":{"name":"Eur. J. Oper. Res.","volume":"1 1","pages":"1202-1214"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82936309","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Affine decision rule approximation to address demand response uncertainty in smart Grids' capacity planning 仿射决策规则逼近解决智能电网容量规划中需求响应不确定性问题
Eur. J. Oper. Res. Pub Date : 2022-02-01 DOI: 10.1016/j.ejor.2022.02.035
Sajad Aliakbari Sani, O. Bahn, E. Delage
{"title":"Affine decision rule approximation to address demand response uncertainty in smart Grids' capacity planning","authors":"Sajad Aliakbari Sani, O. Bahn, E. Delage","doi":"10.1016/j.ejor.2022.02.035","DOIUrl":"https://doi.org/10.1016/j.ejor.2022.02.035","url":null,"abstract":"","PeriodicalId":11868,"journal":{"name":"Eur. J. Oper. Res.","volume":"1 1","pages":"438-455"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77125951","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem 多利益定向问题的边界混合动态规划
Eur. J. Oper. Res. Pub Date : 2022-02-01 DOI: 10.1016/j.ejor.2022.02.045
Hyun-Joong Kim, Byung-In Kim
{"title":"Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem","authors":"Hyun-Joong Kim, Byung-In Kim","doi":"10.1016/j.ejor.2022.02.045","DOIUrl":"https://doi.org/10.1016/j.ejor.2022.02.045","url":null,"abstract":"","PeriodicalId":11868,"journal":{"name":"Eur. J. Oper. Res.","volume":"48 1","pages":"550-566"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90916629","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service 提高任务服务质量的纳米卫星任务调度分支价格算法
Eur. J. Oper. Res. Pub Date : 2022-02-01 DOI: 10.1016/j.ejor.2022.02.040
C. A. Rigo, L. O. Seman, E. Camponogara, Edemar Morsch Filho, E. Bezerra, P. Munari
{"title":"A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service","authors":"C. A. Rigo, L. O. Seman, E. Camponogara, Edemar Morsch Filho, E. Bezerra, P. Munari","doi":"10.1016/j.ejor.2022.02.040","DOIUrl":"https://doi.org/10.1016/j.ejor.2022.02.040","url":null,"abstract":"","PeriodicalId":11868,"journal":{"name":"Eur. J. Oper. Res.","volume":"23 1","pages":"168-183"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84412557","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
首页 上一页 下一页 尾页
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学术官方微信