Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/cor/cor130.bht:"
@article{DBLP:journals/cor/BadriBG21, author = {Hossein Badri and Tayebeh Bahreini and Daniel Grosu}, title = {A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times}, journal = {Comput. Oper. Res.}, volume = {130}, pages = {105238}, year = {2021}, url = {https://doi.org/10.1016/j.cor.2021.105238}, doi = {10.1016/J.COR.2021.105238}, timestamp = {Wed, 24 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/BadriBG21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/Baldomero-Naranjo21, author = {Marta Baldomero{-}Naranjo and J{\"{o}}rg Kalcsics and Antonio M. Rodr{\'{\i}}guez{-}Ch{\'{\i}}a}, title = {Minmax regret maximal covering location problems with edge demands}, journal = {Comput. Oper. Res.}, volume = {130}, pages = {105181}, year = {2021}, url = {https://doi.org/10.1016/j.cor.2020.105181}, doi = {10.1016/J.COR.2020.105181}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cor/Baldomero-Naranjo21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/BoldG21, author = {Matthew Bold and Marc Goerigk}, title = {A compact reformulation of the two-stage robust resource-constrained project scheduling problem}, journal = {Comput. Oper. Res.}, volume = {130}, pages = {105232}, year = {2021}, url = {https://doi.org/10.1016/j.cor.2021.105232}, doi = {10.1016/J.COR.2021.105232}, timestamp = {Fri, 14 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cor/BoldG21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/BurdettCE21, author = {Robert L. Burdett and Paul Corry and Colin Murray Eustace}, title = {Stockpile scheduling with geometry constraints in dry bulk terminals}, journal = {Comput. Oper. Res.}, volume = {130}, pages = {105224}, year = {2021}, url = {https://doi.org/10.1016/j.cor.2021.105224}, doi = {10.1016/J.COR.2021.105224}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/BurdettCE21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/Cardenas-Barron21, author = {Leopoldo Eduardo C{\'{a}}rdenas{-}Barr{\'{o}}n and Rafael A. Melo and Marcio Costa Santos}, title = {Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection}, journal = {Comput. Oper. Res.}, volume = {130}, pages = {105234}, year = {2021}, url = {https://doi.org/10.1016/j.cor.2021.105234}, doi = {10.1016/J.COR.2021.105234}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cor/Cardenas-Barron21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/CheHZL21, author = {Yuxin Che and Kanxin Hu and Zhenzhen Zhang and Andrew Lim}, title = {Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing}, journal = {Comput. Oper. Res.}, volume = {130}, pages = {105245}, year = {2021}, url = {https://doi.org/10.1016/j.cor.2021.105245}, doi = {10.1016/J.COR.2021.105245}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/CheHZL21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/EkrenMTKL21, author = {Banu Yetkin Ekren and Sachin Kumar Mangla and Ecem Eroglu Turhanlar and Yigit Kazan{\c{c}}oglu and Guo Li}, title = {Lateral inventory share-based models for IoT-enabled E-commerce sustainable food supply networks}, journal = {Comput. Oper. Res.}, volume = {130}, pages = {105237}, year = {2021}, url = {https://doi.org/10.1016/j.cor.2021.105237}, doi = {10.1016/J.COR.2021.105237}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cor/EkrenMTKL21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/KetkovPB21, author = {Sergey S. Ketkov and Oleg A. Prokopyev and Evgenii P. Burashnikov}, title = {An approach to the distributionally robust shortest path problem}, journal = {Comput. Oper. Res.}, volume = {130}, pages = {105212}, year = {2021}, url = {https://doi.org/10.1016/j.cor.2021.105212}, doi = {10.1016/J.COR.2021.105212}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cor/KetkovPB21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/KheiriGKLEB21, author = {Ahmed Kheiri and Angeliki Gretsista and Ed Keedwell and Guglielmo Lulli and Michael G. Epitropakis and Edmund K. Burke}, title = {A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem}, journal = {Comput. Oper. Res.}, volume = {130}, pages = {105221}, year = {2021}, url = {https://doi.org/10.1016/j.cor.2021.105221}, doi = {10.1016/J.COR.2021.105221}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cor/KheiriGKLEB21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/LinT21, author = {Yun Hui Lin and Qingyun Tian}, title = {Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness}, journal = {Comput. Oper. Res.}, volume = {130}, pages = {105236}, year = {2021}, url = {https://doi.org/10.1016/j.cor.2021.105236}, doi = {10.1016/J.COR.2021.105236}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/LinT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/LjubicMPG21, author = {Ivana Ljubic and Ahlam Mouaci and Nancy Perrot and {\'{E}}ric Gourdin}, title = {Benders decomposition for a node-capacitated Virtual Network Function placement and routing problem}, journal = {Comput. Oper. Res.}, volume = {130}, pages = {105227}, year = {2021}, url = {https://doi.org/10.1016/j.cor.2021.105227}, doi = {10.1016/J.COR.2021.105227}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cor/LjubicMPG21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/MadrakiJ21, author = {Golshan Madraki and Robert P. Judd}, title = {Accelerating the calculation of makespan used in scheduling improvement heuristics}, journal = {Comput. Oper. Res.}, volume = {130}, pages = {105233}, year = {2021}, url = {https://doi.org/10.1016/j.cor.2021.105233}, doi = {10.1016/J.COR.2021.105233}, timestamp = {Wed, 24 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/MadrakiJ21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/WenLQH21, author = {Muchen Wen and Jun Lin and Yanjun Qian and Weihao Huang}, title = {Scheduling interrelated activities in complex projects under high-order rework: {A} DSM-based approach}, journal = {Comput. Oper. Res.}, volume = {130}, pages = {105246}, year = {2021}, url = {https://doi.org/10.1016/j.cor.2021.105246}, doi = {10.1016/J.COR.2021.105246}, timestamp = {Fri, 14 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cor/WenLQH21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/WuY21, author = {Chia{-}Huang Wu and Dong{-}Yuh Yang}, title = {Bi-objective optimization of a queueing model with two-phase heterogeneous service}, journal = {Comput. Oper. Res.}, volume = {130}, pages = {105230}, year = {2021}, url = {https://doi.org/10.1016/j.cor.2021.105230}, doi = {10.1016/J.COR.2021.105230}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cor/WuY21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.