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/orl10.bht:"
download as .bib file
@article{DBLP:journals/orl/ApplegateCM91,
author = {David L. Applegate and
William J. Cook and
S. Thomas McCormick},
title = {Integral infeasibility and testing total dual integrality},
journal = {Oper. Res. Lett.},
volume = {10},
number = {1},
pages = {37--41},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90084-3},
doi = {10.1016/0167-6377(91)90084-3},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ApplegateCM91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BallesteroR91,
author = {Enrique Ballestero and
Carlos Romero},
title = {A theorem connecting utility function optimization and compromise
programming},
journal = {Oper. Res. Lett.},
volume = {10},
number = {7},
pages = {421--427},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90045-Q},
doi = {10.1016/0167-6377(91)90045-Q},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BallesteroR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Benson91,
author = {Harold P. Benson},
title = {Complete efficiency and the initialization of algorithms for multiple
objective programming},
journal = {Oper. Res. Lett.},
volume = {10},
number = {8},
pages = {481--487},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90026-L},
doi = {10.1016/0167-6377(91)90026-L},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Benson91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BensonA91,
author = {Harold P. Benson and
Yasemin Aksoy},
title = {Using efficient feasible directions in interactive multiple objective
linear programming},
journal = {Oper. Res. Lett.},
volume = {10},
number = {4},
pages = {203--209},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90060-3},
doi = {10.1016/0167-6377(91)90060-3},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BensonA91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BurkardR91,
author = {Rainer E. Burkard and
Franz Rendl},
title = {Lexicographic bottleneck problems},
journal = {Oper. Res. Lett.},
volume = {10},
number = {5},
pages = {303--308},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90018-K},
doi = {10.1016/0167-6377(91)90018-K},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BurkardR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BurkeF91,
author = {James V. Burke and
Michael C. Ferris},
title = {Characterization of solution sets of convex programs},
journal = {Oper. Res. Lett.},
volume = {10},
number = {1},
pages = {57--60},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90087-6},
doi = {10.1016/0167-6377(91)90087-6},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BurkeF91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Cechlarova91,
author = {Katar{\'{\i}}na Cechl{\'{a}}rov{\'{a}}},
title = {The uniquely solvable bipartite matching problem},
journal = {Oper. Res. Lett.},
volume = {10},
number = {4},
pages = {221--224},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90062-T},
doi = {10.1016/0167-6377(91)90062-T},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Cechlarova91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ChenHJ91,
author = {Pey{-}Chun Chen and
Pierre Hansen and
Brigitte Jaumard},
title = {On-line and off-line vertex enumeration by adjacency lists},
journal = {Oper. Res. Lett.},
volume = {10},
number = {7},
pages = {403--409},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90042-N},
doi = {10.1016/0167-6377(91)90042-N},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ChenHJ91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ChiarawongseS91,
author = {Jhitti Chiarawongse and
Mandyam M. Srinivasan},
title = {On pseudo-conservation laws for the cyclic server system with compound
Poisson arrivals},
journal = {Oper. Res. Lett.},
volume = {10},
number = {8},
pages = {453--459},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90022-H},
doi = {10.1016/0167-6377(91)90022-H},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ChiarawongseS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ChristofJR91,
author = {Thomas Christof and
Michael J{\"{u}}nger and
Gerhard Reinelt},
title = {A complete description of the traveling salesman polytope on 8 nodes},
journal = {Oper. Res. Lett.},
volume = {10},
number = {9},
pages = {497--500},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90067-Y},
doi = {10.1016/0167-6377(91)90067-Y},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ChristofJR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ChungT91,
author = {Nam{-}kee Chung and
Dong{-}wan Tcha},
title = {A dual algorithm for submodular flow problems},
journal = {Oper. Res. Lett.},
volume = {10},
number = {8},
pages = {489--495},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90027-M},
doi = {10.1016/0167-6377(91)90027-M},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ChungT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/DalleryT91,
author = {Yves Dallery and
Don Towsley},
title = {Symmetry property of the throughput in closed tandem queueing networks
with finite buffers},
journal = {Oper. Res. Lett.},
volume = {10},
number = {9},
pages = {541--547},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90075-Z},
doi = {10.1016/0167-6377(91)90075-Z},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/DalleryT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/DesrochersL91,
author = {Martin Desrochers and
Gilbert Laporte},
title = {Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination
constraints},
journal = {Oper. Res. Lett.},
volume = {10},
number = {1},
pages = {27--36},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90083-2},
doi = {10.1016/0167-6377(91)90083-2},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/DesrochersL91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Dijk91,
author = {Nico M. van Dijk},
title = {'Stop = recirculate' for exponential product form queueing networks
with departure blocking},
journal = {Oper. Res. Lett.},
volume = {10},
number = {6},
pages = {343--351},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90007-C},
doi = {10.1016/0167-6377(91)90007-C},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Dijk91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Doshi91,
author = {Bharat Doshi},
title = {Analysis of a two phase queueing system with general service times},
journal = {Oper. Res. Lett.},
volume = {10},
number = {5},
pages = {265--272},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90012-E},
doi = {10.1016/0167-6377(91)90012-E},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Doshi91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/DuL91,
author = {Jianzhong Du and
Joseph Y.{-}T. Leung},
title = {Minimizing the number of late jobs on unrelated machines},
journal = {Oper. Res. Lett.},
volume = {10},
number = {3},
pages = {153--158},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90032-K},
doi = {10.1016/0167-6377(91)90032-K},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/DuL91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Dudzinski91,
author = {Krzysztof Dudzinski},
title = {A note on dominance relation in unbounded knapsack problems},
journal = {Oper. Res. Lett.},
volume = {10},
number = {7},
pages = {417--419},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90044-P},
doi = {10.1016/0167-6377(91)90044-P},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Dudzinski91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/DuinV91,
author = {C. W. Duin and
A. Volgenant},
title = {Minimum deviation and balanced optimization: {A} unified approach},
journal = {Oper. Res. Lett.},
volume = {10},
number = {1},
pages = {43--48},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90085-4},
doi = {10.1016/0167-6377(91)90085-4},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/DuinV91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Fathi91,
author = {Yahya Fathi},
title = {{SQVAM:} {A} variance minimizing algorithm},
journal = {Oper. Res. Lett.},
volume = {10},
number = {8},
pages = {461--466},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90023-I},
doi = {10.1016/0167-6377(91)90023-I},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Fathi91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Fernandez-BacaS91,
author = {David Fern{\'{a}}ndez{-}Baca and
S. Srinivasan},
title = {Constructing the minimization diagram of a two-parameter problem},
journal = {Oper. Res. Lett.},
volume = {10},
number = {2},
pages = {87--93},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90092-4},
doi = {10.1016/0167-6377(91)90092-4},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Fernandez-BacaS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/FoxGS91,
author = {Bennett L. Fox and
David Goldsman and
James J. Swain},
title = {Spaced batch means},
journal = {Oper. Res. Lett.},
volume = {10},
number = {5},
pages = {255--263},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90011-D},
doi = {10.1016/0167-6377(91)90011-D},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/FoxGS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Frostig91,
author = {Esther Frostig},
title = {On the optimality of static policy in stochastic open shop},
journal = {Oper. Res. Lett.},
volume = {10},
number = {9},
pages = {509--512},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90069-2},
doi = {10.1016/0167-6377(91)90069-2},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Frostig91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Garcia-Palomares91,
author = {Ubaldo M. Garc{\'{\i}}a{-}Palomares and
William Colmenares},
title = {On the minimization of a quasi-concave function subject to linear
constraints},
journal = {Oper. Res. Lett.},
volume = {10},
number = {3},
pages = {137--141},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90030-S},
doi = {10.1016/0167-6377(91)90030-S},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Garcia-Palomares91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Gerards91,
author = {A. M. H. Gerards},
title = {Compact systems for T-join and perfect matching polyhedra of graphs
with bounded genus},
journal = {Oper. Res. Lett.},
volume = {10},
number = {7},
pages = {377--382},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90038-Q},
doi = {10.1016/0167-6377(91)90038-Q},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Gerards91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GeromelF91,
author = {Jos{\'{e}} Claudio Geromel and
Paulo Augusto Valente Ferreira},
title = {An upper bound on properly efficient solutions in multiobjective optimization},
journal = {Oper. Res. Lett.},
volume = {10},
number = {2},
pages = {83--86},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90091-3},
doi = {10.1016/0167-6377(91)90091-3},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/GeromelF91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GlynnH91,
author = {Peter W. Glynn and
Philip Heidelberger},
title = {Analysis of initial transient deletion for replicated steady-state
simulations},
journal = {Oper. Res. Lett.},
volume = {10},
number = {8},
pages = {437--443},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90020-P},
doi = {10.1016/0167-6377(91)90020-P},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/GlynnH91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GlynnW91,
author = {Peter W. Glynn and
Ward Whitt},
title = {Estimating the asymptotic variance with batch means},
journal = {Oper. Res. Lett.},
volume = {10},
number = {8},
pages = {431--435},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90019-L},
doi = {10.1016/0167-6377(91)90019-L},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/GlynnW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GoemansT91,
author = {Michel X. Goemans and
Kalyan T. Talluri},
title = {2-Change for k-connected networks},
journal = {Oper. Res. Lett.},
volume = {10},
number = {2},
pages = {113--117},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90096-8},
doi = {10.1016/0167-6377(91)90096-8},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/GoemansT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GoldfarbH91,
author = {Donald Goldfarb and
Jianxiu Hao},
title = {On strongly polynomial variants of the network simplex algorithm for
the maximum flow problem},
journal = {Oper. Res. Lett.},
volume = {10},
number = {7},
pages = {383--387},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90039-R},
doi = {10.1016/0167-6377(91)90039-R},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/GoldfarbH91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HallK91,
author = {Nicholas G. Hall and
Wieslaw Kubiak},
title = {Proof of a conjecture of Schrage about the completion time variance
problem},
journal = {Oper. Res. Lett.},
volume = {10},
number = {8},
pages = {467--472},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90024-J},
doi = {10.1016/0167-6377(91)90024-J},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HallK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HamacherR91,
author = {Horst W. Hamacher and
Franz Rendl},
title = {Color constrained combinatorial optimization problems},
journal = {Oper. Res. Lett.},
volume = {10},
number = {4},
pages = {211--219},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90061-S},
doi = {10.1016/0167-6377(91)90061-S},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HamacherR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HassinT91,
author = {Refael Hassin and
Arie Tamir},
title = {Improved complexity bounds for location problems on the real line},
journal = {Oper. Res. Lett.},
volume = {10},
number = {7},
pages = {395--402},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90041-M},
doi = {10.1016/0167-6377(91)90041-M},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HassinT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HayhurstS91,
author = {Kelly J. Hayhurst and
Douglas R. Shier},
title = {A factoring approach for the stochastic shortest path problem},
journal = {Oper. Res. Lett.},
volume = {10},
number = {6},
pages = {329--334},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90005-A},
doi = {10.1016/0167-6377(91)90005-A},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HayhurstS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Hertz91,
author = {Alain Hertz},
title = {Cosine: {A} new graph coloring algorithm},
journal = {Oper. Res. Lett.},
volume = {10},
number = {7},
pages = {411--415},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90043-O},
doi = {10.1016/0167-6377(91)90043-O},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/Hertz91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HerzbergY91,
author = {Meir Herzberg and
Uri Yechiali},
title = {Criteria for selecting the relaxation factor of the value iteration
algorithm for undiscounted Markov and semi-Markov decision processes},
journal = {Oper. Res. Lett.},
volume = {10},
number = {4},
pages = {193--202},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90059-X},
doi = {10.1016/0167-6377(91)90059-X},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HerzbergY91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Hoogeveen91,
author = {J. A. Hoogeveen},
title = {Analysis of Christofides' heuristic: Some paths are more difficult
than cycles},
journal = {Oper. Res. Lett.},
volume = {10},
number = {5},
pages = {291--295},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90016-I},
doi = {10.1016/0167-6377(91)90016-I},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Hoogeveen91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HuangK91,
author = {S. Huang and
Kenneth O. Kortanek},
title = {A note on a potential reduction algorithm for {LP} with simultaneous
primal-dual updating},
journal = {Oper. Res. Lett.},
volume = {10},
number = {9},
pages = {501--507},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90068-Z},
doi = {10.1016/0167-6377(91)90068-Z},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HuangK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HwangY91,
author = {Frank K. Hwang and
Yi{-}Ching Yao},
title = {A direct argument for Kaplansky's theorem on a cyclic arrangement
and its generalization},
journal = {Oper. Res. Lett.},
volume = {10},
number = {4},
pages = {241--243},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90065-W},
doi = {10.1016/0167-6377(91)90065-W},
timestamp = {Wed, 30 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HwangY91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Ikeda91,
author = {Zyukiti Ikeda},
title = {Mean waiting time of a Gamma/Gamma/1 queue},
journal = {Oper. Res. Lett.},
volume = {10},
number = {3},
pages = {177--181},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90036-O},
doi = {10.1016/0167-6377(91)90036-O},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Ikeda91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/JainT91,
author = {Sudha Jain and
James G. C. Templeton},
title = {Confidence interval for {M/M/2} queue with heterogeneous servers},
journal = {Oper. Res. Lett.},
volume = {10},
number = {2},
pages = {99--101},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90094-6},
doi = {10.1016/0167-6377(91)90094-6},
timestamp = {Tue, 09 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/JainT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KaliskiY91,
author = {John A. Kaliski and
Yinyu Ye},
title = {Convergence behavior of Karmarkar's projective algorithm for solving
a simple linear program},
journal = {Oper. Res. Lett.},
volume = {10},
number = {7},
pages = {389--393},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90040-V},
doi = {10.1016/0167-6377(91)90040-V},
timestamp = {Fri, 08 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/KaliskiY91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Kiwiel91,
author = {Krzysztof C. Kiwiel},
title = {A tilted cutting plane proximal bundle method for convex nondifferentiable
optimization},
journal = {Oper. Res. Lett.},
volume = {10},
number = {2},
pages = {75--81},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90090-C},
doi = {10.1016/0167-6377(91)90090-C},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Kiwiel91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KojimaMNY91,
author = {Masakazu Kojima and
Nimrod Megiddo and
Toshihito Noma and
Akiko Yoshise},
title = {A unified approach to interior point algorithms for linear complementarity
problems: {A} summary},
journal = {Oper. Res. Lett.},
volume = {10},
number = {5},
pages = {247--254},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90010-M},
doi = {10.1016/0167-6377(91)90010-M},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/KojimaMNY91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KunoKZ91,
author = {Takahito Kuno and
Hiroshi Konno and
Eitan Zemel},
title = {A linear-time algorithm for solving continuous maximin knapsack problems},
journal = {Oper. Res. Lett.},
volume = {10},
number = {1},
pages = {23--26},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90082-Z},
doi = {10.1016/0167-6377(91)90082-Z},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/KunoKZ91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Levy91,
author = {Hanoch Levy},
title = {A note on the complexity of Swartz's method for calculating the expected
delay in non-symmetric cyclic polling systems},
journal = {Oper. Res. Lett.},
volume = {10},
number = {6},
pages = {363--368},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90009-E},
doi = {10.1016/0167-6377(91)90009-E},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Levy91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LevyL91,
author = {Anat Levy and
Hanoch Levy},
title = {Lock and no-lock mortgage plans: Is it only a matter of risk shifting?},
journal = {Oper. Res. Lett.},
volume = {10},
number = {4},
pages = {233--240},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90064-V},
doi = {10.1016/0167-6377(91)90064-V},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/LevyL91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Luss91,
author = {Hanan Luss},
title = {A nonlinear minimax allocation problem with multiple knapsack constraints},
journal = {Oper. Res. Lett.},
volume = {10},
number = {4},
pages = {183--187},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90057-V},
doi = {10.1016/0167-6377(91)90057-V},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Luss91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Martin91,
author = {R. Kipp Martin},
title = {Using separation algorithms to generate mixed integer model reformulations},
journal = {Oper. Res. Lett.},
volume = {10},
number = {3},
pages = {119--128},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90028-N},
doi = {10.1016/0167-6377(91)90028-N},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Martin91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Martin91a,
author = {G. E. Martin},
title = {Negotiated price discounting of perishable inventories},
journal = {Oper. Res. Lett.},
volume = {10},
number = {9},
pages = {513--518},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90070-6},
doi = {10.1016/0167-6377(91)90070-6},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Martin91a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/MillerZ91,
author = {Douglas A. Miller and
Steven W. Zucker},
title = {Copositive-plus Lemke algorithm solves polymatrix games},
journal = {Oper. Res. Lett.},
volume = {10},
number = {5},
pages = {285--290},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90015-H},
doi = {10.1016/0167-6377(91)90015-H},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/MillerZ91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/MuuO91,
author = {Le Dung Muu and
Werner Oettli},
title = {An algorithm for indefinite quadratic programming with convex constraints},
journal = {Oper. Res. Lett.},
volume = {10},
number = {6},
pages = {323--327},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90004-9},
doi = {10.1016/0167-6377(91)90004-9},
timestamp = {Wed, 06 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/MuuO91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/NemhauserP91,
author = {George L. Nemhauser and
Sungsoo Park},
title = {A polyhedral approach to edge coloring},
journal = {Oper. Res. Lett.},
volume = {10},
number = {6},
pages = {315--322},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90003-8},
doi = {10.1016/0167-6377(91)90003-8},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/NemhauserP91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/NourieV91,
author = {Francis J. Nourie and
Enrique R. Venta},
title = {Finding optimal line balances with OptPack},
journal = {Oper. Res. Lett.},
volume = {10},
number = {3},
pages = {165--171},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90034-M},
doi = {10.1016/0167-6377(91)90034-M},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/NourieV91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/NowickiS91,
author = {Eugeniusz Nowicki and
Czeslaw Smutnicki},
title = {Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling},
journal = {Oper. Res. Lett.},
volume = {10},
number = {8},
pages = {473--480},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90025-K},
doi = {10.1016/0167-6377(91)90025-K},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/NowickiS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/OrdaR91,
author = {Ariel Orda and
Raphael Rom},
title = {Location of central nodes in time varying computer networks},
journal = {Oper. Res. Lett.},
volume = {10},
number = {3},
pages = {143--152},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90031-J},
doi = {10.1016/0167-6377(91)90031-J},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/OrdaR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/PanRHO91,
author = {Andrew C. Pan and
Ranga V. Ramasesh and
Jack C. Hayya and
J. Keith Ord},
title = {Multiple sourcing: The determination of lead times},
journal = {Oper. Res. Lett.},
volume = {10},
number = {1},
pages = {1--7},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90079-5},
doi = {10.1016/0167-6377(91)90079-5},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/PanRHO91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/PeknyMS91,
author = {Joseph F. Pekny and
Donald L. Miller and
Daniel Stodolsky},
title = {A note on exploiting the Hamiltonian cycle problem substructure of
the Asymmetric Traveling Salesman Problem},
journal = {Oper. Res. Lett.},
volume = {10},
number = {3},
pages = {173--176},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90035-N},
doi = {10.1016/0167-6377(91)90035-N},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/PeknyMS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/PerryP91,
author = {David Perry and
Morton J. M. Posner},
title = {Determining the control limit policy in a replacement model with linear
restoration},
journal = {Oper. Res. Lett.},
volume = {10},
number = {6},
pages = {335--341},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90006-B},
doi = {10.1016/0167-6377(91)90006-B},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/PerryP91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/PottsSW91,
author = {Chris N. Potts and
David B. Shmoys and
David P. Williamson},
title = {Permutation vs. non-permutation flow shop schedules},
journal = {Oper. Res. Lett.},
volume = {10},
number = {5},
pages = {281--284},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90014-G},
doi = {10.1016/0167-6377(91)90014-G},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/PottsSW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/RajasekeraF91,
author = {J. R. Rajasekera and
Shu{-}Cherng Fang},
title = {On the convex programming approach to linear programming},
journal = {Oper. Res. Lett.},
volume = {10},
number = {6},
pages = {309--312},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90001-6},
doi = {10.1016/0167-6377(91)90001-6},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/RajasekeraF91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Robinson91,
author = {Lawrence W. Robinson},
title = {Baseball playoff eliminations: An application of linear programming},
journal = {Oper. Res. Lett.},
volume = {10},
number = {2},
pages = {67--74},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90089-8},
doi = {10.1016/0167-6377(91)90089-8},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Robinson91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Robinson91a,
author = {Lawrence W. Robinson},
title = {Baseball playoff eliminations: An application of linear programming},
journal = {Oper. Res. Lett.},
volume = {10},
number = {7},
pages = {429},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90046-R},
doi = {10.1016/0167-6377(91)90046-R},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Robinson91a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/RosbergG91,
author = {Zvi Rosberg and
H. Richard Gail},
title = {{ASTA} implies an M/G/1-like load decomposition for a server with
vacations},
journal = {Oper. Res. Lett.},
volume = {10},
number = {2},
pages = {95--97},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90093-5},
doi = {10.1016/0167-6377(91)90093-5},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/RosbergG91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Serres91,
author = {Yves De Serres},
title = {Simultaneous optimization of flow control and scheduling in a single
server queue with two job classes},
journal = {Oper. Res. Lett.},
volume = {10},
number = {2},
pages = {103--112},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90095-7},
doi = {10.1016/0167-6377(91)90095-7},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Serres91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ShanthikumarYS91,
author = {J. George Shanthikumar and
Genji Yamazaki and
Hirotaka Sakasegawa},
title = {Characterization of optimal order of servers in a tandem queue with
blocking},
journal = {Oper. Res. Lett.},
volume = {10},
number = {1},
pages = {17--22},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90081-Y},
doi = {10.1016/0167-6377(91)90081-Y},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ShanthikumarYS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Shapiro91,
author = {Jeremy F. Shapiro},
title = {Convergent duality for the traveling salesman problem},
journal = {Oper. Res. Lett.},
volume = {10},
number = {3},
pages = {129--136},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90029-O},
doi = {10.1016/0167-6377(91)90029-O},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Shapiro91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Sherali91,
author = {Hanif D. Sherali},
title = {On the equivalence between some shortest path algorithms},
journal = {Oper. Res. Lett.},
volume = {10},
number = {2},
pages = {61--65},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90088-7},
doi = {10.1016/0167-6377(91)90088-7},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Sherali91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Spinrad91,
author = {Jeremy P. Spinrad},
title = {Note on recognition of matroid systems},
journal = {Oper. Res. Lett.},
volume = {10},
number = {6},
pages = {313--314},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90002-7},
doi = {10.1016/0167-6377(91)90002-7},
timestamp = {Wed, 09 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/Spinrad91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/TakagiT91,
author = {Hideaki Takagi and
Yoshitaka Takahashi},
title = {Priority queues with batch Poisson arrivals},
journal = {Oper. Res. Lett.},
volume = {10},
number = {4},
pages = {225--232},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90063-U},
doi = {10.1016/0167-6377(91)90063-U},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/TakagiT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/TakineH91,
author = {Tetsuya Takine and
Toshiharu Hasegawa},
title = {Average waiting time of a symmetric polling system under Bernoulli
scheduling},
journal = {Oper. Res. Lett.},
volume = {10},
number = {9},
pages = {535--539},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90074-Y},
doi = {10.1016/0167-6377(91)90074-Y},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/TakineH91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ToczylowskiP91,
author = {Eugeniusz Toczylowski and
Krzysztof Pienkosz},
title = {Restrictive aggregation of items in multi-stage production systems},
journal = {Oper. Res. Lett.},
volume = {10},
number = {3},
pages = {159--163},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90033-L},
doi = {10.1016/0167-6377(91)90033-L},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ToczylowskiP91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/TowsleyB91,
author = {Don Towsley and
Fran{\c{c}}ois Baccelli},
title = {Comparisons of service disciplines in a tandem queueing network with
real time constraints},
journal = {Oper. Res. Lett.},
volume = {10},
number = {1},
pages = {49--55},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90086-5},
doi = {10.1016/0167-6377(91)90086-5},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/TowsleyB91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/TowsleyT91,
author = {Don Towsley and
Satish K. Tripathi},
title = {A single server priority queue with server failures and queue flushing},
journal = {Oper. Res. Lett.},
volume = {10},
number = {6},
pages = {353--362},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90008-D},
doi = {10.1016/0167-6377(91)90008-D},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/TowsleyT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Vakili91,
author = {Pirooz Vakili},
title = {Using a standard clock technique for efficient simulation},
journal = {Oper. Res. Lett.},
volume = {10},
number = {8},
pages = {445--452},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90021-G},
doi = {10.1016/0167-6377(91)90021-G},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Vakili91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Vanderbei91,
author = {Robert J. Vanderbei},
title = {A brief description of {ALPO}},
journal = {Oper. Res. Lett.},
volume = {10},
number = {9},
pages = {531--534},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90073-X},
doi = {10.1016/0167-6377(91)90073-X},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Vanderbei91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Varadarajan91,
author = {Ravi Varadarajan},
title = {An optimal algorithm for 2 {\texttimes} n bottleneck transportation
problems},
journal = {Oper. Res. Lett.},
volume = {10},
number = {9},
pages = {525--529},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90072-W},
doi = {10.1016/0167-6377(91)90072-W},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Varadarajan91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/WerraBK91,
author = {Dominique de Werra and
Jacek Blazewicz and
Wieslaw Kubiak},
title = {A preemptive open shop scheduling problem with one resource},
journal = {Oper. Res. Lett.},
volume = {10},
number = {1},
pages = {9--15},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90080-9},
doi = {10.1016/0167-6377(91)90080-9},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/WerraBK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/WuF91,
author = {Y. June Wu and
J. David Fuller},
title = {Convergence of multiperiod equilibrium calculations, with geometric
distributed lag demand},
journal = {Oper. Res. Lett.},
volume = {10},
number = {5},
pages = {297--302},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90017-J},
doi = {10.1016/0167-6377(91)90017-J},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/WuF91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Xu91,
author = {Susan H. Xu},
title = {Minimizing expected makespans of multi-priority classes of jobs on
uniform processors},
journal = {Oper. Res. Lett.},
volume = {10},
number = {5},
pages = {273--280},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90013-F},
doi = {10.1016/0167-6377(91)90013-F},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Xu91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Zdrzalka91,
author = {Stanislaw Zdrzalka},
title = {Scheduling jobs on a single machine with release dates, delivery times
and controllable processing times: worst-case analysis},
journal = {Oper. Res. Lett.},
volume = {10},
number = {9},
pages = {519--523},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90071-V},
doi = {10.1016/0167-6377(91)90071-V},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Zdrzalka91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Zhang91,
author = {S. Zhang},
title = {On anti-cycling pivoting rules for the simplex method},
journal = {Oper. Res. Lett.},
volume = {10},
number = {4},
pages = {189--192},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90058-W},
doi = {10.1016/0167-6377(91)90058-W},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Zhang91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ZhaoD91,
author = {Lan Zhao and
Stella Dafermos},
title = {General economic equilibrium and variational inequalities},
journal = {Oper. Res. Lett.},
volume = {10},
number = {7},
pages = {369--376},
year = {1991},
url = {https://doi.org/10.1016/0167-6377(91)90037-P},
doi = {10.1016/0167-6377(91)90037-P},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ZhaoD91.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-31 11:24 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:
