Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/cor/cor103.bht:"
download as .bib file
@article{DBLP:journals/cor/ArakakiU19,
author = {Rafael Kendy Arakaki and
F{\'{a}}bio Luiz Usberti},
title = {An efficiency-based path-scanning heuristic for the capacitated arc
routing problem},
journal = {Comput. Oper. Res.},
volume = {103},
pages = {288--295},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.11.018},
doi = {10.1016/J.COR.2018.11.018},
timestamp = {Fri, 16 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cor/ArakakiU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/BacciMV19,
author = {Tiziano Bacci and
Sara Mattia and
Paolo Ventura},
title = {The bounded beam search algorithm for the block relocation problem},
journal = {Comput. Oper. Res.},
volume = {103},
pages = {252--264},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.11.008},
doi = {10.1016/J.COR.2018.11.008},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/BacciMV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/BekturS19,
author = {Gulcin Bektur and
Tugba Sara{\c{c}}},
title = {A mathematical model and heuristic algorithms for an unrelated parallel
machine scheduling problem with sequence-dependent setup times, machine
eligibility restrictions and a common server},
journal = {Comput. Oper. Res.},
volume = {103},
pages = {46--63},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.10.010},
doi = {10.1016/J.COR.2018.10.010},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cor/BekturS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/BichlerFK19,
author = {Martin Bichler and
Salman Fadaei and
Dennis Kraft},
title = {A simple and fast algorithm for convex decomposition in relax-and-round
mechanisms},
journal = {Comput. Oper. Res.},
volume = {103},
pages = {277--287},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.11.017},
doi = {10.1016/J.COR.2018.11.017},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/BichlerFK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/BieleM19,
author = {Alexander Biele and
Lars M{\"{o}}nch},
title = {Decomposition methods for cost and tardiness reduction in aircraft
manufacturing flow lines},
journal = {Comput. Oper. Res.},
volume = {103},
pages = {134--147},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.10.001},
doi = {10.1016/J.COR.2018.10.001},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/BieleM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/BreunigBHV19,
author = {Ulrich Breunig and
Roberto Baldacci and
Richard F. Hartl and
Thibaut Vidal},
title = {The electric two-echelon vehicle routing problem},
journal = {Comput. Oper. Res.},
volume = {103},
pages = {198--210},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.11.005},
doi = {10.1016/J.COR.2018.11.005},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/BreunigBHV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/BruglieriMPP19,
author = {Maurizio Bruglieri and
Simona Mancini and
Ferdinando Pezzella and
Ornella Pisacane},
title = {A path-based solution approach for the Green Vehicle Routing Problem},
journal = {Comput. Oper. Res.},
volume = {103},
pages = {109--122},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.10.019},
doi = {10.1016/J.COR.2018.10.019},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cor/BruglieriMPP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/BurgelmanV19,
author = {Jeroen Burgelman and
Mario Vanhoucke},
title = {Computing project makespan distributions: Markovian {PERT} networks
revisited},
journal = {Comput. Oper. Res.},
volume = {103},
pages = {123--133},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.10.017},
doi = {10.1016/J.COR.2018.10.017},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/BurgelmanV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/Conde19,
author = {Eduardo Conde},
title = {Robust minmax regret combinatorial optimization problems with a resource-dependent
uncertainty polyhedron of scenarios},
journal = {Comput. Oper. Res.},
volume = {103},
pages = {97--108},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.10.014},
doi = {10.1016/J.COR.2018.10.014},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/Conde19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/ContardoIK19,
author = {Claudio Contardo and
Manuel Iori and
Raphael Kramer},
title = {A scalable exact algorithm for the vertex \emph{p}-center problem},
journal = {Comput. Oper. Res.},
volume = {103},
pages = {211--220},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.11.006},
doi = {10.1016/J.COR.2018.11.006},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cor/ContardoIK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/DingSLP19,
author = {Junwen Ding and
Liji Shen and
Zhipeng L{\"{u}} and
Bo Peng},
title = {Parallel machine scheduling with completion-time-based criteria and
sequence-dependent deterioration},
journal = {Comput. Oper. Res.},
volume = {103},
pages = {35--45},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.10.016},
doi = {10.1016/J.COR.2018.10.016},
timestamp = {Wed, 10 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/DingSLP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/GalligariS19,
author = {Alessandro Galligari and
Marco Sciandrone},
title = {A computational study of path-based methods for optimal traffic assignment
with both inelastic and elastic demand},
journal = {Comput. Oper. Res.},
volume = {103},
pages = {158--166},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.11.004},
doi = {10.1016/J.COR.2018.11.004},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/GalligariS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/HughesGW19,
author = {Martin Hughes and
Marc Goerigk and
Michael Wright},
title = {A largest empty hypersphere metaheuristic for robust optimisation
with implementation uncertainty},
journal = {Comput. Oper. Res.},
volume = {103},
pages = {64--80},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.10.013},
doi = {10.1016/J.COR.2018.10.013},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/HughesGW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/KlausnitzerL19,
author = {Armin Klausnitzer and
Rainer Lasch},
title = {Optimal facility layout and material handling network design},
journal = {Comput. Oper. Res.},
volume = {103},
pages = {237--251},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.11.002},
doi = {10.1016/J.COR.2018.11.002},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/KlausnitzerL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/KovalyovKMP19,
author = {Mikhail Y. Kovalyov and
Dominik Kress and
Sebastian Meiswinkel and
Erwin Pesch},
title = {A parallel machine schedule updating game with compensations and clients
averse to uncertain loss},
journal = {Comput. Oper. Res.},
volume = {103},
pages = {148--157},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.11.003},
doi = {10.1016/J.COR.2018.11.003},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/KovalyovKMP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/LewisTM19,
author = {Rhyd Lewis and
Dhananjay R. Thiruvady and
Kerri Morgan},
title = {Finding happiness: An analysis of the maximum happy vertices problem},
journal = {Comput. Oper. Res.},
volume = {103},
pages = {265--276},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.11.015},
doi = {10.1016/J.COR.2018.11.015},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/LewisTM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/LeymanDVC19,
author = {Pieter Leyman and
Niels Van Driessche and
Mario Vanhoucke and
Patrick De Causmaecker},
title = {The impact of solution representations on heuristic net present value
optimization in discrete time/cost trade-off project scheduling with
multiple cash flow and payment models},
journal = {Comput. Oper. Res.},
volume = {103},
pages = {184--197},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.11.011},
doi = {10.1016/J.COR.2018.11.011},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/LeymanDVC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/MartinezAJMT19,
author = {Karim Y. P. Mart{\'{\i}}nez and
Yossiri Adulyasak and
Raf Jans and
Reinaldo Morabito and
Eli Angela V. Toso},
title = {An exact optimization approach for an integrated process configuration,
lot-sizing, and scheduling problem},
journal = {Comput. Oper. Res.},
volume = {103},
pages = {310--323},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.10.005},
doi = {10.1016/J.COR.2018.10.005},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/MartinezAJMT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/NasirianPN19,
author = {Farzaneh Nasirian and
Foad Mahdavi Pajouh and
Josephine M. Namayanja},
title = {Exact algorithms for the minimum cost vertex blocker clique problem},
journal = {Comput. Oper. Res.},
volume = {103},
pages = {296--309},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.11.016},
doi = {10.1016/J.COR.2018.11.016},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/NasirianPN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/Nino-Mora19,
author = {Jos{\'{e}} Ni{\~{n}}o{-}Mora},
title = {Resource allocation and routing in parallel multi-server queues with
abandonments for cloud profit maximization},
journal = {Comput. Oper. Res.},
volume = {103},
pages = {221--236},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.11.012},
doi = {10.1016/J.COR.2018.11.012},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/Nino-Mora19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/RossitVTF19,
author = {Diego Gabriel Rossit and
Daniele Vigo and
Fernando Tohm{\'{e}} and
Mariano Frutos},
title = {Visual attractiveness in routing problems: {A} review},
journal = {Comput. Oper. Res.},
volume = {103},
pages = {13--34},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.10.012},
doi = {10.1016/J.COR.2018.10.012},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/RossitVTF19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/StrubT19,
author = {Oliver Strub and
Norbert Trautmann},
title = {A two-stage approach to the UCITS-constrained index-tracking problem},
journal = {Comput. Oper. Res.},
volume = {103},
pages = {167--183},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.10.002},
doi = {10.1016/J.COR.2018.10.002},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/StrubT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/WangZWCYW19,
author = {Dujuan Wang and
Jiaqi Zhu and
Xiaowen Wei and
T. C. E. Cheng and
Yunqiang Yin and
Yanzhang Wang},
title = {Integrated production and multiple trips vehicle routing with time
windows and uncertain travel times},
journal = {Comput. Oper. Res.},
volume = {103},
pages = {1--12},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.10.011},
doi = {10.1016/J.COR.2018.10.011},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cor/WangZWCYW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/ZhangCLL19,
author = {Zhenzhen Zhang and
Brenda Cheang and
Chongshou Li and
Andrew Lim},
title = {Multi-commodity demand fulfillment via simultaneous pickup and delivery
for a fast fashion retailer},
journal = {Comput. Oper. Res.},
volume = {103},
pages = {81--96},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.10.020},
doi = {10.1016/J.COR.2018.10.020},
timestamp = {Wed, 17 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cor/ZhangCLL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-07-23 09:33 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
