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/orl29.bht:"
download as .bib file
@article{DBLP:journals/orl/AghezzafO01,
author = {B. Aghezzaf and
T. Ouaderhman},
title = {An interactive interior point algorithm for multiobjective linear
programming problems},
journal = {Oper. Res. Lett.},
volume = {29},
number = {4},
pages = {163--170},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00089-X},
doi = {10.1016/S0167-6377(01)00089-X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/AghezzafO01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ArthanariU01,
author = {Tiru S. Arthanari and
Usha Mohan},
title = {On the equivalence of the multistage-insertion and cycle-shrink formulations
of the symmetric traveling salesman problem},
journal = {Oper. Res. Lett.},
volume = {29},
number = {3},
pages = {129--139},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00088-8},
doi = {10.1016/S0167-6377(01)00088-8},
timestamp = {Tue, 05 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/ArthanariU01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Atamturk01,
author = {Alper Atamt{\"{u}}rk},
title = {Flow pack facets of the single node fixed-charge flow polytope},
journal = {Oper. Res. Lett.},
volume = {29},
number = {3},
pages = {107--114},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00100-6},
doi = {10.1016/S0167-6377(01)00100-6},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Atamturk01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BalakrishnanMM01,
author = {Anantaram Balakrishnan and
Thomas L. Magnanti and
Prakash Mirchandani},
title = {Intuitive solution-doubling techniques for worst-case analysis of
some survivable network design problems},
journal = {Oper. Res. Lett.},
volume = {29},
number = {3},
pages = {99--106},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00094-3},
doi = {10.1016/S0167-6377(01)00094-3},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BalakrishnanMM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BoyaciG01,
author = {Tamer Boyaci and
Guillermo Gallego},
title = {Minimizing holding and ordering costs subject to a bound on backorders
is as easy as solving a single backorder cost model},
journal = {Oper. Res. Lett.},
volume = {29},
number = {4},
pages = {187--192},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00095-5},
doi = {10.1016/S0167-6377(01)00095-5},
timestamp = {Wed, 21 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BoyaciG01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BreitSS01,
author = {Joachim Breit and
G{\"{u}}nter Schmidt and
Vitaly A. Strusevich},
title = {Two-machine open shop scheduling with an availability constraint},
journal = {Oper. Res. Lett.},
volume = {29},
number = {2},
pages = {65--77},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00079-7},
doi = {10.1016/S0167-6377(01)00079-7},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BreitSS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Bumb01,
author = {Adriana Felicia Bumb},
title = {An approximation algorithm for the maximization version of the two
level uncapacitated facility location problem},
journal = {Oper. Res. Lett.},
volume = {29},
number = {4},
pages = {155--161},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00087-6},
doi = {10.1016/S0167-6377(01)00087-6},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Bumb01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/DahlW01,
author = {Travis A. Dahl and
Thomas R. Willemain},
title = {The effect of long-memory arrivals on queue performance},
journal = {Oper. Res. Lett.},
volume = {29},
number = {3},
pages = {123--127},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00090-6},
doi = {10.1016/S0167-6377(01)00090-6},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/DahlW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/DeinekoW01,
author = {Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {Hardness of approximation of the discrete time-cost tradeoff problem},
journal = {Oper. Res. Lett.},
volume = {29},
number = {5},
pages = {207--210},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00102-X},
doi = {10.1016/S0167-6377(01)00102-X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/DeinekoW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Epstein01,
author = {Leah Epstein},
title = {Optimal preemptive on-line scheduling on uniform processors with non-decreasing
speed ratios},
journal = {Oper. Res. Lett.},
volume = {29},
number = {2},
pages = {93--98},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00085-2},
doi = {10.1016/S0167-6377(01)00085-2},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Epstein01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/FariasN01,
author = {Ismael R. de Farias Jr. and
George L. Nemhauser},
title = {A family of inequalities for the generalized assignment polytope},
journal = {Oper. Res. Lett.},
volume = {29},
number = {2},
pages = {49--55},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00086-4},
doi = {10.1016/S0167-6377(01)00086-4},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/FariasN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Franx01,
author = {Geert Jan Franx},
title = {A simple solution for the M/D/\emph{c} waiting time distribution},
journal = {Oper. Res. Lett.},
volume = {29},
number = {5},
pages = {221--229},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00108-0},
doi = {10.1016/S0167-6377(01)00108-0},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/Franx01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GarcigaIS01,
author = {O. Rolando G{\'{a}}rciga and
Alfredo N. Iusem and
Benar Fux Svaiter},
title = {On the need for hybrid steps in hybrid proximal point methods},
journal = {Oper. Res. Lett.},
volume = {29},
number = {5},
pages = {217--220},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00101-8},
doi = {10.1016/S0167-6377(01)00101-8},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/GarcigaIS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GoldbergS01,
author = {Robert R. Goldberg and
Jacob Shapiro},
title = {Extending Graham's result on scheduling to other heuristics},
journal = {Oper. Res. Lett.},
volume = {29},
number = {4},
pages = {149--153},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00098-0},
doi = {10.1016/S0167-6377(01)00098-0},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/GoldbergS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GrassmannCK01,
author = {Winfried K. Grassmann and
Xin Chen and
Brij R. K. Kashyap},
title = {Optimal service rates for the state-dependent {M/G/1} queues in steady
state},
journal = {Oper. Res. Lett.},
volume = {29},
number = {2},
pages = {57--63},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00084-0},
doi = {10.1016/S0167-6377(01)00084-0},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/GrassmannCK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Haviv01,
author = {Moshe Haviv},
title = {The Aumann-Shapley price mechanism for allocating congestion costs},
journal = {Oper. Res. Lett.},
volume = {29},
number = {5},
pages = {211--215},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00096-7},
doi = {10.1016/S0167-6377(01)00096-7},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Haviv01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HoogeveenW01,
author = {Han Hoogeveen and
Gerhard J. Woeginger},
title = {A very difficult scheduling problem with communication delays},
journal = {Oper. Res. Lett.},
volume = {29},
number = {5},
pages = {241--245},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00103-1},
doi = {10.1016/S0167-6377(01)00103-1},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HoogeveenW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HurinkK01,
author = {Johann L. Hurink and
Sigrid Knust},
title = {List scheduling in a parallel machine environment with precedence
constraints and setup times},
journal = {Oper. Res. Lett.},
volume = {29},
number = {5},
pages = {231--239},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00104-3},
doi = {10.1016/S0167-6377(01)00104-3},
timestamp = {Mon, 06 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HurinkK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Imreh01,
author = {Csan{\'{a}}d Imreh},
title = {Online strip packing with modifiable boxes},
journal = {Oper. Res. Lett.},
volume = {29},
number = {2},
pages = {79--85},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00081-5},
doi = {10.1016/S0167-6377(01)00081-5},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Imreh01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KaminskyS01,
author = {Philip M. Kaminsky and
David Simchi{-}Levi},
title = {Asymptotic analysis of an on-line algorithm for the single machine
completion time problem with release dates},
journal = {Oper. Res. Lett.},
volume = {29},
number = {3},
pages = {141--148},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00099-2},
doi = {10.1016/S0167-6377(01)00099-2},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/KaminskyS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KyparisisK01,
author = {George J. Kyparisis and
Christos Koulamas},
title = {A note on weighted completion time minimization in a flexible flow
shop},
journal = {Oper. Res. Lett.},
volume = {29},
number = {1},
pages = {5--11},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00072-4},
doi = {10.1016/S0167-6377(01)00072-4},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/KyparisisK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/MarcotteSZ01,
author = {Patrice Marcotte and
Gilles Savard and
Daoli Zhu},
title = {A trust region algorithm for nonlinear bilevel programming},
journal = {Oper. Res. Lett.},
volume = {29},
number = {4},
pages = {171--179},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00092-X},
doi = {10.1016/S0167-6377(01)00092-X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/MarcotteSZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Prekopa01,
author = {Andr{\'{a}}s Pr{\'{e}}kopa},
title = {On the concavity of multivariate probability distribution functions},
journal = {Oper. Res. Lett.},
volume = {29},
number = {1},
pages = {1--4},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00070-0},
doi = {10.1016/S0167-6377(01)00070-0},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Prekopa01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/RighterS01,
author = {Rhonda Righter and
J. George Shanthikumar},
title = {Optimal ordering of operations in a manufacturing chain},
journal = {Oper. Res. Lett.},
volume = {29},
number = {3},
pages = {115--121},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00091-8},
doi = {10.1016/S0167-6377(01)00091-8},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/RighterS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Singh01,
author = {Gaurav Singh},
title = {Performance of critical path type algorithms for scheduling on parallel
processors},
journal = {Oper. Res. Lett.},
volume = {29},
number = {1},
pages = {17--30},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00077-3},
doi = {10.1016/S0167-6377(01)00077-3},
timestamp = {Wed, 02 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/Singh01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/StadjeZ01,
author = {Wolfgang Stadje and
Dror Zuckerman},
title = {A random walk model for a multi-component deteriorating system},
journal = {Oper. Res. Lett.},
volume = {29},
number = {5},
pages = {199--205},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00109-2},
doi = {10.1016/S0167-6377(01)00109-2},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/StadjeZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/SunL01,
author = {Xiaoling Sun and
Duan Li},
title = {On the relationship between the integer and continuous solutions of
convex programs},
journal = {Oper. Res. Lett.},
volume = {29},
number = {2},
pages = {87--92},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00082-7},
doi = {10.1016/S0167-6377(01)00082-7},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/SunL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Tuncel01,
author = {Levent Tun{\c{c}}el},
title = {On the Slater condition for the {SDP} relaxations of nonconvex sets},
journal = {Oper. Res. Lett.},
volume = {29},
number = {4},
pages = {181--186},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00093-1},
doi = {10.1016/S0167-6377(01)00093-1},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/Tuncel01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/YamanKP01,
author = {Hande Yaman and
Oya Ekin Karasan and
Mustafa {\c{C}}. Pinar},
title = {The robust spanning tree problem with interval data},
journal = {Oper. Res. Lett.},
volume = {29},
number = {1},
pages = {31--40},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00078-5},
doi = {10.1016/S0167-6377(01)00078-5},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/YamanKP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/YueC01,
author = {Dequan Yue and
Jinhua Cao},
title = {Some results on successive failure times of a system with minimal
instantaneous repairs},
journal = {Oper. Res. Lett.},
volume = {29},
number = {4},
pages = {193--197},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00097-9},
doi = {10.1016/S0167-6377(01)00097-9},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/YueC01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ZhangTC01,
author = {Feng Zhang and
Guochun Tang and
Zhi{-}Long Chen},
title = {A 3/2-approximation algorithm for parallel machine scheduling with
controllable processing times},
journal = {Oper. Res. Lett.},
volume = {29},
number = {1},
pages = {41--47},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00080-3},
doi = {10.1016/S0167-6377(01)00080-3},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ZhangTC01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ZukermanJNW01,
author = {Moshe Zukerman and
Long Jia and
Timothy D. Neame and
Gerhard J. Woeginger},
title = {A polynomially solvable special case of the unbounded knapsack problem},
journal = {Oper. Res. Lett.},
volume = {29},
number = {1},
pages = {13--16},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00076-1},
doi = {10.1016/S0167-6377(01)00076-1},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ZukermanJNW01.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-05-29 10:31 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:
