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/orl26.bht:"
download as .bib file
@article{DBLP:journals/orl/Araoz00,
author = {Juli{\'{a}}n Ar{\'{a}}oz},
title = {Forward chaining is simple(\emph{x})},
journal = {Oper. Res. Lett.},
volume = {26},
number = {1},
pages = {23--26},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(99)00055-3},
doi = {10.1016/S0167-6377(99)00055-3},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Araoz00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Barahona00,
author = {Francisco Barahona},
title = {On the \emph{k}-cut problem},
journal = {Oper. Res. Lett.},
volume = {26},
number = {3},
pages = {99--105},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(99)00071-1},
doi = {10.1016/S0167-6377(99)00071-1},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Barahona00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BrownDO00,
author = {Gerald G. Brown and
Robert F. Dell and
Michael P. Olson},
title = {Valid integer polytope {(VIP)} penalties for branch-and-bound enumeration},
journal = {Oper. Res. Lett.},
volume = {26},
number = {3},
pages = {117--126},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(99)00072-3},
doi = {10.1016/S0167-6377(99)00072-3},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BrownDO00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ChengW00,
author = {T. C. Edwin Cheng and
Guoqing Wang},
title = {An improved heuristic for two-machine flowshop scheduling with an
availability constraint},
journal = {Oper. Res. Lett.},
volume = {26},
number = {5},
pages = {223--229},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(00)00033-X},
doi = {10.1016/S0167-6377(00)00033-X},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ChengW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Csenki00,
author = {Attila Csenki},
title = {Asymptotics for renewal-reward processes with retrospective reward
structure},
journal = {Oper. Res. Lett.},
volume = {26},
number = {5},
pages = {201--209},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(00)00035-3},
doi = {10.1016/S0167-6377(00)00035-3},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Csenki00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/EpsteinS00,
author = {Leah Epstein and
Jir{\'{\i}} Sgall},
title = {A lower bound for on-line scheduling on uniformly related machines},
journal = {Oper. Res. Lett.},
volume = {26},
number = {1},
pages = {17--22},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(99)00062-0},
doi = {10.1016/S0167-6377(99)00062-0},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/EpsteinS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GhianiI00,
author = {Gianpaolo Ghiani and
Gennaro Improta},
title = {An algorithm for the hierarchical Chinese postman problem},
journal = {Oper. Res. Lett.},
volume = {26},
number = {1},
pages = {27--32},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(99)00046-2},
doi = {10.1016/S0167-6377(99)00046-2},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/GhianiI00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GoemansWW00,
author = {Michel X. Goemans and
Joel Wein and
David P. Williamson},
title = {A 1.47-approximation algorithm for a preemptive single-machine scheduling
problem},
journal = {Oper. Res. Lett.},
volume = {26},
number = {4},
pages = {149--154},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(00)00024-9},
doi = {10.1016/S0167-6377(00)00024-9},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/GoemansWW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GrippoS00,
author = {Luigi Grippo and
Marco Sciandrone},
title = {On the convergence of the block nonlinear Gauss-Seidel method under
convex constraints},
journal = {Oper. Res. Lett.},
volume = {26},
number = {3},
pages = {127--136},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(99)00074-7},
doi = {10.1016/S0167-6377(99)00074-7},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/GrippoS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GuntzerJ00,
author = {Michael M. G{\"{u}}ntzer and
Dieter Jungnickel},
title = {Approximate minimization algorithms for the 0/1 Knapsack and Subset-Sum
Problem},
journal = {Oper. Res. Lett.},
volume = {26},
number = {2},
pages = {55--66},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(99)00066-8},
doi = {10.1016/S0167-6377(99)00066-8},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/GuntzerJ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/He00,
author = {Qi{-}Ming He},
title = {Classification of Markov processes of {M/G/1} type with a tree structure
and its applications to queueing models},
journal = {Oper. Res. Lett.},
volume = {26},
number = {2},
pages = {67--80},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(99)00057-7},
doi = {10.1016/S0167-6377(99)00057-7},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/He00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HolderC00,
author = {Allen G. Holder and
Richard J. Caron},
title = {Uniform bounds on the limiting and marginal derivatives of the analytic
center solution over a set of normalized weights},
journal = {Oper. Res. Lett.},
volume = {26},
number = {2},
pages = {49--54},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(99)00073-5},
doi = {10.1016/S0167-6377(99)00073-5},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HolderC00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HwangOR00,
author = {Frank K. Hwang and
Shmuel Onn and
Uriel G. Rothblum},
title = {Linear-shaped partition problems},
journal = {Oper. Res. Lett.},
volume = {26},
number = {4},
pages = {159--163},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(99)00069-3},
doi = {10.1016/S0167-6377(99)00069-3},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HwangOR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KoulamasK00,
author = {Christos Koulamas and
George J. Kyparisis},
title = {Scheduling on uniform parallel machines to minimize maximum lateness},
journal = {Oper. Res. Lett.},
volume = {26},
number = {4},
pages = {175--179},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(00)00018-3},
doi = {10.1016/S0167-6377(00)00018-3},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/KoulamasK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Lawphongpanich00,
author = {Siriphong Lawphongpanich},
title = {Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear
multicommodity network flow problems with side constraints},
journal = {Oper. Res. Lett.},
volume = {26},
number = {1},
pages = {33--41},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(99)00059-0},
doi = {10.1016/S0167-6377(99)00059-0},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Lawphongpanich00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LuebkeP00,
author = {Emily Larson Luebke and
J. Scott Provan},
title = {On the structure and complexity of the 2-connected Steiner network
problem in the plane},
journal = {Oper. Res. Lett.},
volume = {26},
number = {3},
pages = {111--116},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(99)00068-1},
doi = {10.1016/S0167-6377(99)00068-1},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/LuebkeP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LunaM00,
author = {Henrique Pacca Loureiro Luna and
P. Mahey},
title = {Bounds for global optimization of capacity expansion and flow assignment
problems},
journal = {Oper. Res. Lett.},
volume = {26},
number = {5},
pages = {211--216},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(00)00027-4},
doi = {10.1016/S0167-6377(00)00027-4},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/LunaM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Muller00,
author = {Alfred M{\"{u}}ller},
title = {On the waiting times in queues with dependency between interarrival
and service times},
journal = {Oper. Res. Lett.},
volume = {26},
number = {1},
pages = {43--47},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(99)00060-7},
doi = {10.1016/S0167-6377(99)00060-7},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Muller00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/PerryP00,
author = {David Perry and
Morton J. M. Posner},
title = {A correlated M/G/1-type queue with randomized server repair and maintenance
modes},
journal = {Oper. Res. Lett.},
volume = {26},
number = {3},
pages = {137--147},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(99)00067-X},
doi = {10.1016/S0167-6377(99)00067-X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/PerryP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Salama00,
author = {Y. Salama},
title = {Optimal control of a simple manufacturing system with restarting costs},
journal = {Oper. Res. Lett.},
volume = {26},
number = {1},
pages = {9--16},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(99)00061-9},
doi = {10.1016/S0167-6377(99)00061-9},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Salama00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/SanchezK00,
author = {Susan M. Sanchez and
Prabhudev Konana},
title = {Efficient data allocation for frequency domain experiments},
journal = {Oper. Res. Lett.},
volume = {26},
number = {2},
pages = {81--89},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(99)00070-X},
doi = {10.1016/S0167-6377(99)00070-X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/SanchezK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/SheraliCT00,
author = {Hanif D. Sherali and
Gyunghyun Choi and
Cihan H. Tuncbilek},
title = {A variable target value method for nondifferentiable optimization},
journal = {Oper. Res. Lett.},
volume = {26},
number = {1},
pages = {1--8},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(99)00063-2},
doi = {10.1016/S0167-6377(99)00063-2},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/SheraliCT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/SidneyPS00,
author = {Jeffrey B. Sidney and
Chris N. Potts and
Chelliah Sriskandarajah},
title = {A heuristic for scheduling two-machine no-wait flow shops with anticipatory
setups},
journal = {Oper. Res. Lett.},
volume = {26},
number = {4},
pages = {165--173},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(00)00019-5},
doi = {10.1016/S0167-6377(00)00019-5},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/SidneyPS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Strusevich00,
author = {Vitaly A. Strusevich},
title = {Group technology approach to the open shop scheduling problem with
batch setup times},
journal = {Oper. Res. Lett.},
volume = {26},
number = {4},
pages = {181--192},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(00)00021-3},
doi = {10.1016/S0167-6377(00)00021-3},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Strusevich00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Sviridenko00,
author = {Maxim Sviridenko},
title = {Worst-case analysis of the greedy algorithm for a generalization of
the maximum p-facility location problem},
journal = {Oper. Res. Lett.},
volume = {26},
number = {4},
pages = {193--197},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(00)00022-5},
doi = {10.1016/S0167-6377(00)00022-5},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Sviridenko00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/TeunterP00,
author = {Ruud H. Teunter and
Edo S. Van der Poort},
title = {The maximum number of Hamiltonian cycles in graphs with a fixed number
of vertices and edges},
journal = {Oper. Res. Lett.},
volume = {26},
number = {2},
pages = {91--98},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(99)00075-9},
doi = {10.1016/S0167-6377(99)00075-9},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/TeunterP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Thorlund-Petersen00,
author = {Lars Thorlund{-}Petersen},
title = {Comparison of probability measures: Dominance of the third degree},
journal = {Oper. Res. Lett.},
volume = {26},
number = {5},
pages = {237--245},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(00)00031-6},
doi = {10.1016/S0167-6377(00)00031-6},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Thorlund-Petersen00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/TijmsV00,
author = {Henk C. Tijms and
R. Veldman},
title = {A fast algorithm for the transient reward distribution in continuous-time
Markov chains},
journal = {Oper. Res. Lett.},
volume = {26},
number = {4},
pages = {155--158},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(00)00023-7},
doi = {10.1016/S0167-6377(00)00023-7},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/TijmsV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Woeginger00a,
author = {Gerhard J. Woeginger},
title = {A comment on scheduling on uniform machines under chain-type precedence
constraints},
journal = {Oper. Res. Lett.},
volume = {26},
number = {3},
pages = {107--109},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(99)00076-0},
doi = {10.1016/S0167-6377(99)00076-0},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Woeginger00a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ZhangCW00,
author = {Guochuan Zhang and
Xiaoqiang Cai and
C. K. Wong},
title = {Linear time-approximation algorithms for bin packing},
journal = {Oper. Res. Lett.},
volume = {26},
number = {5},
pages = {217--222},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(99)00077-2},
doi = {10.1016/S0167-6377(99)00077-2},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/ZhangCW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ZhengS00,
author = {Shen Zheng and
Andrew F. Seila},
title = {Some well-behaved estimators for the {M/M/1} queue},
journal = {Oper. Res. Lett.},
volume = {26},
number = {5},
pages = {231--235},
year = {2000},
url = {https://doi.org/10.1016/S0167-6377(00)00030-4},
doi = {10.1016/S0167-6377(00)00030-4},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ZhengS00.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-04-25 11:46 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:
