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/orl22.bht:"
download as .bib file
@article{DBLP:journals/orl/BalinskiS98,
author = {Michel Balinski and
Niousha Shahidi},
title = {A simple approach to the product rate variation problem \emph{via}
axiomatics},
journal = {Oper. Res. Lett.},
volume = {22},
number = {4-5},
pages = {129--135},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(98)00008-X},
doi = {10.1016/S0167-6377(98)00008-X},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BalinskiS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Barzilai98,
author = {Jonathan Barzilai},
title = {On the decomposition of value functions},
journal = {Oper. Res. Lett.},
volume = {22},
number = {4-5},
pages = {159--170},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(98)00015-7},
doi = {10.1016/S0167-6377(98)00015-7},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Barzilai98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BrimbergCC98,
author = {Jack Brimberg and
Reuven Chen and
Doron Chen},
title = {Accelerating convergence in the Fermat-Weber location problem},
journal = {Oper. Res. Lett.},
volume = {22},
number = {4-5},
pages = {151--157},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(98)00016-9},
doi = {10.1016/S0167-6377(98)00016-9},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BrimbergCC98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ChudakGHW98,
author = {Fabi{\'{a}}n A. Chudak and
Michel X. Goemans and
Dorit S. Hochbaum and
David P. Williamson},
title = {A primal-dual interpretation of two 2-approximation algorithms for
the feedback vertex set problem in undirected graphs},
journal = {Oper. Res. Lett.},
volume = {22},
number = {4-5},
pages = {111--118},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(98)00021-2},
doi = {10.1016/S0167-6377(98)00021-2},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ChudakGHW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Dahl98a,
author = {Geir Dahl},
title = {Polytopes related to the l\({}_{\mbox{infinity}}\)-distance between
vectors},
journal = {Oper. Res. Lett.},
volume = {22},
number = {1},
pages = {49--54},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(97)00048-5},
doi = {10.1016/S0167-6377(97)00048-5},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/Dahl98a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/DeinekoW98,
author = {Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {A solvable case of the quadratic assignment problem},
journal = {Oper. Res. Lett.},
volume = {22},
number = {1},
pages = {13--17},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(97)00047-3},
doi = {10.1016/S0167-6377(97)00047-3},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/DeinekoW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/FullerM98,
author = {J. David Fuller and
Frederic H. Murphy},
title = {On the convergence of the decoupling algorithm for multiperiod equilibrium
models},
journal = {Oper. Res. Lett.},
volume = {22},
number = {1},
pages = {33--39},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(98)00002-9},
doi = {10.1016/S0167-6377(98)00002-9},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/FullerM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Garcia-Palomares98,
author = {Ubaldo M. Garc{\'{\i}}a{-}Palomares},
title = {A superlinearly convergent projection algorithm for solving the convex
inequality problem},
journal = {Oper. Res. Lett.},
volume = {22},
number = {2-3},
pages = {97--103},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(98)00003-0},
doi = {10.1016/S0167-6377(98)00003-0},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Garcia-Palomares98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HansenMT98,
author = {Pierre Hansen and
Nenad Mladenovic and
{\'{E}}ric D. Taillard},
title = {Heuristic solution of the multisource Weber problem as a p-median
problem},
journal = {Oper. Res. Lett.},
volume = {22},
number = {2-3},
pages = {55--62},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(98)00004-2},
doi = {10.1016/S0167-6377(98)00004-2},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HansenMT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HeijdenK98,
author = {Matthieu van der Heijden and
Ton G. de Kok},
title = {Estimating stock levels in periodic review inventory systems},
journal = {Oper. Res. Lett.},
volume = {22},
number = {4-5},
pages = {179--182},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(98)00020-0},
doi = {10.1016/S0167-6377(98)00020-0},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HeijdenK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/IwataMM98,
author = {Satoru Iwata and
Tomomi Matsui and
S. Thomas McCormick},
title = {A fast bipartite network flow algorithm for selective assembly},
journal = {Oper. Res. Lett.},
volume = {22},
number = {4-5},
pages = {137--143},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(98)00017-0},
doi = {10.1016/S0167-6377(98)00017-0},
timestamp = {Wed, 16 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/IwataMM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/JungerT98,
author = {Michael J{\"{u}}nger and
Stefan Thienel},
title = {Introduction to {ABACUS} - a branch-and-cut system},
journal = {Oper. Res. Lett.},
volume = {22},
number = {2-3},
pages = {83--95},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(98)00013-3},
doi = {10.1016/S0167-6377(98)00013-3},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/JungerT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KimL98,
author = {DaeSoo Kim and
Won J. Lee},
title = {Optimal coordination strategies for production and marketing decisions},
journal = {Oper. Res. Lett.},
volume = {22},
number = {1},
pages = {41--47},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(97)00052-7},
doi = {10.1016/S0167-6377(97)00052-7},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/KimL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KlinzW98,
author = {Bettina Klinz and
Gerhard J. Woeginger},
title = {One, two, three, many, or: complexity aspects of dynamic network flows
with dedicated arcs},
journal = {Oper. Res. Lett.},
volume = {22},
number = {4-5},
pages = {119--127},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(98)00009-1},
doi = {10.1016/S0167-6377(98)00009-1},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/KlinzW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LannMR98,
author = {Avital Lann and
Gur Mosheiov and
Yosef Rinott},
title = {Asymptotic optimality in probability of a heuristic schedule for open
shops with job overlaps},
journal = {Oper. Res. Lett.},
volume = {22},
number = {2-3},
pages = {63--68},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(98)00007-8},
doi = {10.1016/S0167-6377(98)00007-8},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/LannMR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Lim98,
author = {Andrew Lim},
title = {The berth planning problem},
journal = {Oper. Res. Lett.},
volume = {22},
number = {2-3},
pages = {105--110},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(98)00010-8},
doi = {10.1016/S0167-6377(98)00010-8},
timestamp = {Wed, 17 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Lim98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LinYH98,
author = {Guo{-}Hui Lin and
En{-}Yu Yao and
Yong He},
title = {Parallel machine scheduling to maximize the minimum load with nonsimultaneous
machine available times},
journal = {Oper. Res. Lett.},
volume = {22},
number = {2-3},
pages = {75--81},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(97)00053-9},
doi = {10.1016/S0167-6377(97)00053-9},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/LinYH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Mathur98,
author = {Kamlesh Mathur},
title = {An integer-programming-based heuristic for the balanced loading problem},
journal = {Oper. Res. Lett.},
volume = {22},
number = {1},
pages = {19--25},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(97)00044-8},
doi = {10.1016/S0167-6377(97)00044-8},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Mathur98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/MehrotraT98,
author = {Anuj Mehrotra and
Michael A. Trick},
title = {Cliques and clustering: {A} combinatorial approach},
journal = {Oper. Res. Lett.},
volume = {22},
number = {1},
pages = {1--12},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(98)00006-6},
doi = {10.1016/S0167-6377(98)00006-6},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/MehrotraT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Rispoli98,
author = {Fred J. Rispoli},
title = {The monotonic diameter of traveling salesman polytopes},
journal = {Oper. Res. Lett.},
volume = {22},
number = {2-3},
pages = {69--73},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(98)00011-X},
doi = {10.1016/S0167-6377(98)00011-X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Rispoli98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Seiden98,
author = {Steven S. Seiden},
title = {Randomized online interval scheduling},
journal = {Oper. Res. Lett.},
volume = {22},
number = {4-5},
pages = {171--177},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(98)00019-4},
doi = {10.1016/S0167-6377(98)00019-4},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Seiden98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/SturmZ98,
author = {Jos F. Sturm and
Shuzhong Zhang},
title = {On the long-step path-following method for semidefinite programming},
journal = {Oper. Res. Lett.},
volume = {22},
number = {4-5},
pages = {145--150},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(98)00014-5},
doi = {10.1016/S0167-6377(98)00014-5},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/SturmZ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Willmot98,
author = {Gordon E. Willmot},
title = {On a class of approximations for ruin and waiting time probabilities},
journal = {Oper. Res. Lett.},
volume = {22},
number = {1},
pages = {27--32},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(97)00046-1},
doi = {10.1016/S0167-6377(97)00046-1},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Willmot98.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-25 16:17 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:
