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/orl/orl31.bht:"
download as .bib file
@article{DBLP:journals/orl/AbbadB03,
author = {Mohammed Abbad and
Hatim Boustique},
title = {A decomposition algorithm for limiting average Markov decision problems},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {473--476},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00055-5},
doi = {10.1016/S0167-6377(03)00055-5},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/AbbadB03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Afeche03,
author = {Philipp Af{\`{e}}che},
title = {Delay performance in stochastic processing networks with priority
service},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {390--400},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00021-X},
doi = {10.1016/S0167-6377(03)00021-X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Afeche03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/AhujaOS03,
author = {Ravindra K. Ahuja and
James B. Orlin and
Dushyant Sharma},
title = {A composite very large-scale neighborhood structure for the capacitated
minimum spanning tree problem},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {185--194},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00236-5},
doi = {10.1016/S0167-6377(02)00236-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/AhujaOS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/AkkerHW03,
author = {Marjan van den Akker and
Han Hoogeveen and
Gerhard J. Woeginger},
title = {The two-machine open shop problem: To fit or not to fit, that is the
question},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {219--224},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00018-X},
doi = {10.1016/S0167-6377(03)00018-X},
timestamp = {Sat, 10 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/AkkerHW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Alfa03,
author = {Attahiru Sule Alfa},
title = {Waiting time distribution of the MAP/D/k system in discrete time -
a more efficient algorithm},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {263--267},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00003-8},
doi = {10.1016/S0167-6377(03)00003-8},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Alfa03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BallCZ03,
author = {Michael O. Ball and
Chien{-}Yu Chen and
Zhen{-}Ying Zhao},
title = {Material compatibility constraints for make-to-order production planning},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {420--428},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00045-2},
doi = {10.1016/S0167-6377(03)00045-2},
timestamp = {Mon, 18 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BallCZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Bansal03,
author = {Nikhil Bansal},
title = {Analysis of the {M/G/1} processor-sharing queue with bulk arrivals},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {401--405},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00029-4},
doi = {10.1016/S0167-6377(03)00029-4},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/Bansal03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BarciaC03,
author = {Paulo B{\'{a}}rcia and
J. Orestes Cerdeira},
title = {Node packings on cocomparability graphs},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {341--342},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00023-3},
doi = {10.1016/S0167-6377(03)00023-3},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BarciaC03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BeckT03,
author = {Amir Beck and
Marc Teboulle},
title = {Mirror descent and nonlinear projected subgradient methods for convex
optimization},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {167--175},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00231-6},
doi = {10.1016/S0167-6377(02)00231-6},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BeckT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Ben-AriehGPYZ03,
author = {David Ben{-}Arieh and
Gregory Z. Gutin and
M. Penn and
Anders Yeo and
Alexey Zverovich},
title = {Transformations of generalized {ATSP} into {ATSP}},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {357--365},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00031-2},
doi = {10.1016/S0167-6377(03)00031-2},
timestamp = {Thu, 22 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/Ben-AriehGPYZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BianchiP03,
author = {Monica Bianchi and
Rita Pini},
title = {A note on stability for parametric equilibrium problems},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {445--450},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00051-8},
doi = {10.1016/S0167-6377(03)00051-8},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/BianchiP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BorstBMQ03,
author = {Sem C. Borst and
Onno J. Boxma and
John A. Morrison and
R. N{\'{u}}{\~{n}}ez Queija},
title = {The equivalence between processor sharing and service in random order},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {254--262},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00006-3},
doi = {10.1016/S0167-6377(03)00006-3},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BorstBMQ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Brinkhuis03,
author = {Jan Brinkhuis},
title = {On the complexity of the primal self-concordant barrier method},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {442--444},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00056-7},
doi = {10.1016/S0167-6377(03)00056-7},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Brinkhuis03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BruckerHH03,
author = {Peter Brucker and
Silvia Heitmann and
Johann L. Hurink},
title = {How useful are preemptive schedules?},
journal = {Oper. Res. Lett.},
volume = {31},
number = {2},
pages = {129--136},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00220-1},
doi = {10.1016/S0167-6377(02)00220-1},
timestamp = {Mon, 06 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BruckerHH03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BruggemannMW03,
author = {Tobias Br{\"{u}}ggemann and
J{\'{e}}r{\^{o}}me Monnot and
Gerhard J. Woeginger},
title = {Local search for the minimum label spanning tree problem with bounded
color classes},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {195--201},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00241-9},
doi = {10.1016/S0167-6377(02)00241-9},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BruggemannMW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/CalveteP03,
author = {Herminia I. Calvete and
Lourdes del Pozo},
title = {The quickest path problem with batch constraints},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {277--284},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00239-0},
doi = {10.1016/S0167-6377(02)00239-0},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/CalveteP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/CalvinL03,
author = {James M. Calvin and
Joseph Y.{-}T. Leung},
title = {Average-case analysis of a greedy algorithm for the 0/1 knapsack problem},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {202--210},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00222-5},
doi = {10.1016/S0167-6377(02)00222-5},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/CalvinL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ChanasZ03,
author = {Stefan Chanas and
Pawel Zielinski},
title = {On the hardness of evaluating criticality of activities in a planar
network with duration intervals},
journal = {Oper. Res. Lett.},
volume = {31},
number = {1},
pages = {53--59},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00174-8},
doi = {10.1016/S0167-6377(02)00174-8},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ChanasZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ChauS03,
author = {Chi{-}Kin Chau and
Kwang Mong Sim},
title = {The price of anarchy for non-atomic congestion games with symmetric
cost maps and elastic demands},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {327--334},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00030-0},
doi = {10.1016/S0167-6377(03)00030-0},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ChauS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ChaudhryK03,
author = {Mohan L. Chaudhry and
Nam K. Kim},
title = {A complete and simple solution for a discrete-time multi-server queue
with bulk arrivals and deterministic service times},
journal = {Oper. Res. Lett.},
volume = {31},
number = {2},
pages = {101--107},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00214-6},
doi = {10.1016/S0167-6377(02)00214-6},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ChaudhryK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/CheevaprawatdomrongS03,
author = {Torpong Cheevaprawatdomrong and
Robert L. Smith},
title = {A paradox in equipment replacement under technological improvement},
journal = {Oper. Res. Lett.},
volume = {31},
number = {1},
pages = {77--82},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00153-0},
doi = {10.1016/S0167-6377(02)00153-0},
timestamp = {Wed, 22 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/CheevaprawatdomrongS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ChenLT03,
author = {Jiahua Chen and
Dennis K. J. Lin and
Douglas J. Thomas},
title = {On the single item fill rate for a finite horizon},
journal = {Oper. Res. Lett.},
volume = {31},
number = {2},
pages = {119--123},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00233-X},
doi = {10.1016/S0167-6377(02)00233-X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ChenLT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ChengL03,
author = {T. C. Edwin Cheng and
Zhaohui Liu},
title = {Approximability of two-machine no-wait flowshop scheduling with availability
constraints},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {319--322},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00230-4},
doi = {10.1016/S0167-6377(02)00230-4},
timestamp = {Sun, 27 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/ChengL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ConfortiHR03,
author = {Michele Conforti and
Refael Hassin and
R. Ravi},
title = {Reconstructing edge-disjoint paths},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {273--276},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00022-1},
doi = {10.1016/S0167-6377(03)00022-1},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ConfortiHR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/CostaLR03,
author = {Marie{-}Christine Costa and
Lucas L{\'{e}}tocart and
Fr{\'{e}}d{\'{e}}ric Roupin},
title = {A greedy algorithm for multicut and integral multiflow in rooted trees},
journal = {Oper. Res. Lett.},
volume = {31},
number = {1},
pages = {21--27},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00184-0},
doi = {10.1016/S0167-6377(02)00184-0},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/CostaLR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/CroceT03,
author = {Federico Della Croce and
Vincent T'kindt},
title = {Improving the preemptive bound for the one-machine dynamic total completion
time scheduling problem},
journal = {Oper. Res. Lett.},
volume = {31},
number = {2},
pages = {142--148},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00215-8},
doi = {10.1016/S0167-6377(02)00215-8},
timestamp = {Fri, 16 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/CroceT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/DadunaS03,
author = {Hans Daduna and
Ryszard Szekli},
title = {Dependence structure of sojourn times via partition separated ordering},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {462--472},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00054-3},
doi = {10.1016/S0167-6377(03)00054-3},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/DadunaS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/DahlF03,
author = {Geir Dahl and
Nj{\aa}l Foldnes},
title = {Complete description of a class of knapsack polytopes},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {335--340},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00017-8},
doi = {10.1016/S0167-6377(03)00017-8},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/DahlF03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/DudinK03,
author = {Alexander N. Dudin and
Valentina I. Klimenok},
title = {Optimal admission control in a queueing system with heterogeneous
traffic},
journal = {Oper. Res. Lett.},
volume = {31},
number = {2},
pages = {108--118},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00218-3},
doi = {10.1016/S0167-6377(02)00218-3},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/DudinK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ElfJR03,
author = {Matthias Elf and
Michael J{\"{u}}nger and
Giovanni Rinaldi},
title = {Minimizing breaks by maximizing cuts},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {343--349},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00025-7},
doi = {10.1016/S0167-6377(03)00025-7},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/ElfJR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/EscuderoGP03,
author = {Laureano F. Escudero and
Mar{\'{\i}}a Araceli Gar{\'{\i}}n and
Gloria P{\'{e}}rez},
title = {An O(n log n) procedure for identifying facets of the knapsack polytope},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {211--218},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00221-3},
doi = {10.1016/S0167-6377(02)00221-3},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/EscuderoGP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Fujishige03,
author = {Satoru Fujishige},
title = {A maximum flow algorithm using {MA} ordering},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {176--178},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00237-7},
doi = {10.1016/S0167-6377(02)00237-7},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Fujishige03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GSK03,
author = {Young{-}Gun G and
Young{-}Jo Seong and
Maing{-}Kyu Kang},
title = {A best-first branch and bound algorithm for unconstrained two-dimensional
cutting problems},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {301--307},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00002-6},
doi = {10.1016/S0167-6377(03)00002-6},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/GSK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GloverS03,
author = {Fred W. Glover and
Hanif D. Sherali},
title = {Foundation-penalty cuts for mixed-integer programs},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {245--253},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00014-2},
doi = {10.1016/S0167-6377(03)00014-2},
timestamp = {Tue, 04 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/GloverS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GomezDLV03,
author = {Jose Antonio Barcia Gomez and
Jos{\'{e}} Miguel D{\'{\i}}az{-}B{\'{a}}{\~{n}}ez and
Antonio Jose Lozano and
Inmaculada Ventura},
title = {Computing an obnoxious anchored segment},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {293--300},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00015-4},
doi = {10.1016/S0167-6377(03)00015-4},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/GomezDLV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HaouariG03,
author = {Mohamed Haouari and
Anis Gharbi},
title = {An improved max-flow-based lower bound for minimizing maximum lateness
on identical parallel machines},
journal = {Oper. Res. Lett.},
volume = {31},
number = {1},
pages = {49--52},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00177-3},
doi = {10.1016/S0167-6377(02)00177-3},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HaouariG03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HassinR03,
author = {Refael Hassin and
Shlomi Rubinstein},
title = {Approximation algorithms for the metric maximum clustering problem
with given cluster sizes},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {179--184},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00235-3},
doi = {10.1016/S0167-6377(02)00235-3},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HassinR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Henderson03,
author = {Shane G. Henderson},
title = {Estimation for nonhomogeneous Poisson processes from aggregated data},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {375--382},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00027-0},
doi = {10.1016/S0167-6377(03)00027-0},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Henderson03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HendersonG03,
author = {Shane G. Henderson and
Peter W. Glynn},
title = {Nonexistence of a class of variate generation schemes},
journal = {Oper. Res. Lett.},
volume = {31},
number = {2},
pages = {83--89},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00217-1},
doi = {10.1016/S0167-6377(02)00217-1},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HendersonG03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HouH03,
author = {Sixiang Hou and
Han Hoogeveen},
title = {The three-machine proportionate flow shop problem with unequal machine
speeds},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {225--231},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00232-8},
doi = {10.1016/S0167-6377(02)00232-8},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HouH03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HuhJJS03,
author = {Woonghee Tim Huh and
Ganesh Janakiraman and
Peter L. Jackson and
Nidhi Sawhney},
title = {Minimizing flow time in cyclic schedules for identical jobs with acyclic
precedence: the bottleneck lower bound},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {366--374},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00004-X},
doi = {10.1016/S0167-6377(03)00004-X},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HuhJJS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HurkensV03,
author = {Cor A. J. Hurkens and
Tjark Vredeveld},
title = {Local search for multiprocessor scheduling: how many moves does it
take to a local optimum?},
journal = {Oper. Res. Lett.},
volume = {31},
number = {2},
pages = {137--141},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00212-2},
doi = {10.1016/S0167-6377(02)00212-2},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HurkensV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Jorge03,
author = {Jes{\'{u}}s M. Jorge},
title = {Maximal descriptor set characterizations of efficient faces in multiple
objective linear programming},
journal = {Oper. Res. Lett.},
volume = {31},
number = {2},
pages = {124--128},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00216-X},
doi = {10.1016/S0167-6377(02)00216-X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Jorge03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KaraEV03,
author = {Bahar Yetis Kara and
Erhan Erkut and
Vedat Verter},
title = {Accurate calculation of hazardous materials transport risks},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {285--292},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00238-9},
doi = {10.1016/S0167-6377(02)00238-9},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/KaraEV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KellererK03,
author = {Hans Kellerer and
Vladimir Kotov},
title = {An approximation algorithm with absolute worst-case performance ratio
2 for two-dimensional vector packing},
journal = {Oper. Res. Lett.},
volume = {31},
number = {1},
pages = {35--41},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00173-6},
doi = {10.1016/S0167-6377(02)00173-6},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/KellererK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Kharoufeh03,
author = {Jeffrey P. Kharoufeh},
title = {Explicit results for wear processes in a Markovian environment},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {237--244},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00229-8},
doi = {10.1016/S0167-6377(02)00229-8},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Kharoufeh03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Kieffer03,
author = {Yann Kieffer},
title = {The facets of the polytope of modules of a graph},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {435--441},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00049-X},
doi = {10.1016/S0167-6377(03)00049-X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Kieffer03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KimM03,
author = {Yong J. Kim and
Michael V. Mannino},
title = {Optimal incentive-compatible pricing for {M/G/1} queues},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {459--461},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00060-9},
doi = {10.1016/S0167-6377(03)00060-9},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/KimM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KumaranMS03,
author = {Krishnan Kumaran and
Michel Mandjes and
Alexander L. Stolyar},
title = {Convexity properties of loss and overflow functions},
journal = {Oper. Res. Lett.},
volume = {31},
number = {2},
pages = {95--100},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00191-8},
doi = {10.1016/S0167-6377(02)00191-8},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/KumaranMS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Lee03,
author = {Seung{-}Min Lee},
title = {On the characterization of continuum structure functions},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {268--272},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00240-7},
doi = {10.1016/S0167-6377(02)00240-7},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Lee03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LippmanM03,
author = {Steven A. Lippman and
Kevin F. McCardle},
title = {Comparative statics of cell phone plans},
journal = {Oper. Res. Lett.},
volume = {31},
number = {1},
pages = {63--65},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00188-8},
doi = {10.1016/S0167-6377(02)00188-8},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/LippmanM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LiuYC03,
author = {Zhaohui Liu and
Jinjiang Yuan and
T. C. Edwin Cheng},
title = {On scheduling an unbounded batch machine},
journal = {Oper. Res. Lett.},
volume = {31},
number = {1},
pages = {42--48},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00186-4},
doi = {10.1016/S0167-6377(02)00186-4},
timestamp = {Sun, 27 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/LiuYC03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LuSS03,
author = {Xiwen Lu and
Ren{\'{e}} Sitters and
Leen Stougie},
title = {A class of on-line scheduling algorithms to minimize total completion
time},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {232--236},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00016-6},
doi = {10.1016/S0167-6377(03)00016-6},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/LuSS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/MasuyamaT03,
author = {Hiroyuki Masuyama and
Tetsuya Takine},
title = {Sojourn time distribution in a {MAP/M/1} processor-sharing queue},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {406--412},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00028-2},
doi = {10.1016/S0167-6377(03)00028-2},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/MasuyamaT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Muller03,
author = {Alfred M{\"{u}}ller},
title = {On the interplay between variability and negative dependence for bivariate
distributions},
journal = {Oper. Res. Lett.},
volume = {31},
number = {2},
pages = {90--94},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00234-1},
doi = {10.1016/S0167-6377(02)00234-1},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Muller03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/NgCYL03,
author = {C. T. Ng and
T. C. Edwin Cheng and
Jinjiang Yuan and
Zhaohui Liu},
title = {On the single machine serial batching scheduling problem to minimize
total completion time with precedence constraints, release dates and
identical processing times},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {323--326},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00007-5},
doi = {10.1016/S0167-6377(03)00007-5},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/NgCYL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/OswaldR03,
author = {Marcus Oswald and
Gerhard Reinelt},
title = {The weighted consecutive ones problem for a fixed number of rows or
columns},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {350--356},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00024-5},
doi = {10.1016/S0167-6377(03)00024-5},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/OswaldR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/PallottinoS03,
author = {Stefano Pallottino and
Maria Grazia Scutell{\`{a}}},
title = {A new algorithm for reoptimizing shortest paths when the arc costs
change},
journal = {Oper. Res. Lett.},
volume = {31},
number = {2},
pages = {149--160},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00192-X},
doi = {10.1016/S0167-6377(02)00192-X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/PallottinoS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Pan03,
author = {Yunpeng Pan},
title = {An improved branch and bound algorithm for single machine scheduling
with deadlines to minimize total weighted completion time},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {492--496},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00048-8},
doi = {10.1016/S0167-6377(03)00048-8},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Pan03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/PerryS03,
author = {David Perry and
Wolfgang Stadje},
title = {Duality of dams via mountain processes},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {451--458},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00032-4},
doi = {10.1016/S0167-6377(03)00032-4},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/PerryS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/PleguezueloPR03,
author = {Rafael Herrer{\'{\i}}as Pleguezuelo and
Jos{\'{e}} Garc{\'{\i}}a P{\'{e}}rez and
Salvador Cruz Rambaud},
title = {A note on the reasonableness of {PERT} hypotheses},
journal = {Oper. Res. Lett.},
volume = {31},
number = {1},
pages = {60--62},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00151-7},
doi = {10.1016/S0167-6377(02)00151-7},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/PleguezueloPR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/PolzinD03,
author = {Tobias Polzin and
Siavash {Vahdati Daneshmand}},
title = {On Steiner trees and minimum spanning trees in hypergraphs},
journal = {Oper. Res. Lett.},
volume = {31},
number = {1},
pages = {12--20},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00185-2},
doi = {10.1016/S0167-6377(02)00185-2},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/PolzinD03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ResingO03,
author = {Jacques Resing and
E. Lerzan {\"{O}}rmeci},
title = {A tandem queueing model with coupled processors},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {383--389},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00046-4},
doi = {10.1016/S0167-6377(03)00046-4},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ResingO03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/SchusterF03,
author = {Christoph J. Schuster and
Jose M. Frami{\~{n}}an},
title = {Approximative procedures for no-wait job shop scheduling},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {308--318},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00005-1},
doi = {10.1016/S0167-6377(03)00005-1},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/SchusterF03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Stadje03,
author = {Wolfgang Stadje},
title = {Renewal analysis of a replacement process},
journal = {Oper. Res. Lett.},
volume = {31},
number = {1},
pages = {1--6},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00176-1},
doi = {10.1016/S0167-6377(02)00176-1},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Stadje03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/TopalogluP03,
author = {Huseyin Topaloglu and
Warren B. Powell},
title = {An algorithm for approximating piecewise linear concave functions
from sample gradients},
journal = {Oper. Res. Lett.},
volume = {31},
number = {1},
pages = {66--76},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00187-6},
doi = {10.1016/S0167-6377(02)00187-6},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/TopalogluP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Uetz03,
author = {Marc Uetz},
title = {When greediness fails: examples from stochastic scheduling},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {413--419},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00047-6},
doi = {10.1016/S0167-6377(03)00047-6},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Uetz03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Vairaktarakis03,
author = {George L. Vairaktarakis},
title = {On Gilmore-Gomory's open question for the bottleneck {TSP}},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {483--491},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00050-6},
doi = {10.1016/S0167-6377(03)00050-6},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Vairaktarakis03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/VenturaE03,
author = {Paolo Ventura and
Friedrich Eisenbrand},
title = {A compact linear program for testing optimality of perfect matchings},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {429--434},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00052-X},
doi = {10.1016/S0167-6377(03)00052-X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/VenturaE03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Voorneveld03,
author = {Mark Voorneveld},
title = {Characterization of Pareto dominance},
journal = {Oper. Res. Lett.},
volume = {31},
number = {1},
pages = {7--11},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00189-X},
doi = {10.1016/S0167-6377(02)00189-X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Voorneveld03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/VredeveldL03,
author = {Tjark Vredeveld and
Jan Karel Lenstra},
title = {On local search for the generalized graph coloring problem},
journal = {Oper. Res. Lett.},
volume = {31},
number = {1},
pages = {28--34},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00165-7},
doi = {10.1016/S0167-6377(02)00165-7},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/VredeveldL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Zhang03,
author = {Liping Zhang},
title = {On the convergence of a modified algorithm for the spherical facility
location problem},
journal = {Oper. Res. Lett.},
volume = {31},
number = {2},
pages = {161--166},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00190-6},
doi = {10.1016/S0167-6377(02)00190-6},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Zhang03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Zhang03a,
author = {Jun Zhang},
title = {Managing multi-customer service level requirements with a simple rationing
policy},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {477--482},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00053-1},
doi = {10.1016/S0167-6377(03)00053-1},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Zhang03a.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-06-06 15:34 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:
