Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/orl/orl32.bht:"
@article{DBLP:journals/orl/Alfa04, author = {Attahiru Sule Alfa}, title = {Loss probability in an overloaded discrete-time {GI/G/1/K} system with very large \emph{K}}, journal = {Oper. Res. Lett.}, volume = {32}, number = {5}, pages = {439--447}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.12.005}, doi = {10.1016/J.ORL.2003.12.005}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Alfa04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/AppaMM04, author = {Gautam Appa and Dimitris Magos and Ioannis Mourtos}, title = {An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6}, journal = {Oper. Res. Lett.}, volume = {32}, number = {4}, pages = {336--344}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.10.010}, doi = {10.1016/J.ORL.2003.10.010}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/orl/AppaMM04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/AronH04, author = {Ionut D. Aron and Pascal Van Hentenryck}, title = {On the complexity of the robust spanning tree problem with interval data}, journal = {Oper. Res. Lett.}, volume = {32}, number = {1}, pages = {36--40}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00058-0}, doi = {10.1016/S0167-6377(03)00058-0}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/AronH04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Averbakh04, author = {Igor Averbakh}, title = {Minmax regret linear resource allocation problems}, journal = {Oper. Res. Lett.}, volume = {32}, number = {2}, pages = {174--180}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00091-9}, doi = {10.1016/S0167-6377(03)00091-9}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Averbakh04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/BaptisteCDJV04, author = {Philippe Baptiste and Marek Chrobak and Christoph D{\"{u}}rr and Wojciech Jawor and Nodari Vakhania}, title = {Preemptive scheduling of equal-length jobs to maximize weighted throughput}, journal = {Oper. Res. Lett.}, volume = {32}, number = {3}, pages = {258--264}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.09.004}, doi = {10.1016/J.ORL.2003.09.004}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/BaptisteCDJV04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Bar-YehudaR04, author = {Reuven Bar{-}Yehuda and Dror Rawitz}, title = {Local ratio with negative weights}, journal = {Oper. Res. Lett.}, volume = {32}, number = {6}, pages = {540--546}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2004.02.001}, doi = {10.1016/J.ORL.2004.02.001}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Bar-YehudaR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/BartholdiG04, author = {John J. Bartholdi III and Paul Goldsman}, title = {The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle}, journal = {Oper. Res. Lett.}, volume = {32}, number = {4}, pages = {304--308}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.11.005}, doi = {10.1016/J.ORL.2003.11.005}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/BartholdiG04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/BaryshnikovCJMR04, author = {Yuliy M. Baryshnikov and Edward G. Coffman Jr. and Predrag R. Jelenkovic and Petar Momcilovic and Dan Rubenstein}, title = {Flood search under the California Split rule}, journal = {Oper. Res. Lett.}, volume = {32}, number = {3}, pages = {199--206}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.08.007}, doi = {10.1016/J.ORL.2003.08.007}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/BaryshnikovCJMR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/BertsimasPS04, author = {Dimitris Bertsimas and Dessislava Pachamanova and Melvyn Sim}, title = {Robust linear optimization under general norms}, journal = {Oper. Res. Lett.}, volume = {32}, number = {6}, pages = {510--516}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.12.007}, doi = {10.1016/J.ORL.2003.12.007}, timestamp = {Sat, 30 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/BertsimasPS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/BoschH04, author = {Robert P. Bosch Jr. and Adrianne Herman}, title = {Continuous line drawings via the traveling salesman problem}, journal = {Oper. Res. Lett.}, volume = {32}, number = {4}, pages = {302--303}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.10.001}, doi = {10.1016/J.ORL.2003.10.001}, timestamp = {Wed, 31 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/BoschH04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Byskov04, author = {Jesper Makholm Byskov}, title = {Enumerating maximal independent sets with applications to graph colouring}, journal = {Oper. Res. Lett.}, volume = {32}, number = {6}, pages = {547--556}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2004.03.002}, doi = {10.1016/J.ORL.2004.03.002}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/orl/Byskov04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/CalveteG04, author = {Herminia I. Calvete and Carmen Gal{\'{e}}}, title = {Solving linear fractional bilevel programs}, journal = {Oper. Res. Lett.}, volume = {32}, number = {2}, pages = {143--151}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.07.003}, doi = {10.1016/J.ORL.2003.07.003}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/CalveteG04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Caprara04, author = {Alberto Caprara}, title = {Book reviews}, journal = {Oper. Res. Lett.}, volume = {32}, number = {5}, pages = {496--497}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2004.01.002}, doi = {10.1016/J.ORL.2004.01.002}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Caprara04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/CapraraM04, author = {Alberto Caprara and Michele Monaci}, title = {On the two-dimensional Knapsack Problem}, journal = {Oper. Res. Lett.}, volume = {32}, number = {1}, pages = {5--14}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00057-9}, doi = {10.1016/S0167-6377(03)00057-9}, timestamp = {Sat, 16 Sep 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/CapraraM04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/CapraraP04, author = {Alberto Caprara and Ulrich Pferschy}, title = {Worst-case analysis of the subset sum algorithm for bin packing}, journal = {Oper. Res. Lett.}, volume = {32}, number = {2}, pages = {159--166}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00092-0}, doi = {10.1016/S0167-6377(03)00092-0}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/CapraraP04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/CastroS04, author = {I. T. Castro and E. L. Sanju{\'{a}}n}, title = {Power processes and their application to reliability}, journal = {Oper. Res. Lett.}, volume = {32}, number = {5}, pages = {415--421}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.11.009}, doi = {10.1016/J.ORL.2003.11.009}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/orl/CastroS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/ChaovalitwongsePP04, author = {Wanpracha Art Chaovalitwongse and Panos M. Pardalos and Oleg A. Prokopyev}, title = {A new linearization technique for multi-quadratic 0-1 programming problems}, journal = {Oper. Res. Lett.}, volume = {32}, number = {6}, pages = {517--522}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2004.03.005}, doi = {10.1016/J.ORL.2004.03.005}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/orl/ChaovalitwongsePP04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/ChaudhryC04, author = {Mohan L. Chaudhry and Seok Ho Chang}, title = {Analysis of the discrete-time bulk-service queue Geo/G\({}^{\mbox{Y}}\)/1/\emph{N}+\emph{B}}, journal = {Oper. Res. Lett.}, volume = {32}, number = {4}, pages = {355--363}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.09.006}, doi = {10.1016/J.ORL.2003.09.006}, timestamp = {Wed, 08 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/orl/ChaudhryC04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/ChengV04, author = {Eddie Cheng and Sven de Vries}, title = {Separating multi-oddity constrained shortest circuits over the polytope of stable multisets}, journal = {Oper. Res. Lett.}, volume = {32}, number = {2}, pages = {181--184}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.05.001}, doi = {10.1016/J.ORL.2003.05.001}, timestamp = {Sat, 01 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/ChengV04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/ChoiK04, author = {Bong Dae Choi and Bara Kim}, title = {Non-ergodicity criteria for denumerable continuous time Markov processes}, journal = {Oper. Res. Lett.}, volume = {32}, number = {6}, pages = {574--580}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2004.03.001}, doi = {10.1016/J.ORL.2004.03.001}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/ChoiK04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/ChoiKHK04, author = {Bong Dae Choi and Bara Kim and Gang Uk Hwang and Jae{-}kyoon Kim}, title = {The analysis of a multiserver queue fed by a discrete autoregressive process of order 1}, journal = {Oper. Res. Lett.}, volume = {32}, number = {1}, pages = {85--93}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00068-3}, doi = {10.1016/S0167-6377(03)00068-3}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/ChoiKHK04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/DahlFG04, author = {Geir Dahl and Nj{\aa}l Foldnes and Luis Eduardo Neves Gouveia}, title = {A note on hop-constrained walk polytopes}, journal = {Oper. Res. Lett.}, volume = {32}, number = {4}, pages = {345--349}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.10.008}, doi = {10.1016/J.ORL.2003.10.008}, timestamp = {Mon, 21 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/DahlFG04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/DahlG04, author = {Geir Dahl and Luis Eduardo Neves Gouveia}, title = {On the directed hop-constrained shortest path problem}, journal = {Oper. Res. Lett.}, volume = {32}, number = {1}, pages = {15--22}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00026-9}, doi = {10.1016/S0167-6377(03)00026-9}, timestamp = {Mon, 21 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/DahlG04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Ehrenmann04, author = {Andreas Ehrenmann}, title = {Manifolds of multi-leader Cournot equilibria}, journal = {Oper. Res. Lett.}, volume = {32}, number = {2}, pages = {121--125}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00090-7}, doi = {10.1016/S0167-6377(03)00090-7}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Ehrenmann04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/EvenGKRS04, author = {Guy Even and Naveen Garg and Jochen K{\"{o}}nemann and R. Ravi and Amitabh Sinha}, title = {Min-max tree covers of graphs}, journal = {Oper. Res. Lett.}, volume = {32}, number = {4}, pages = {309--315}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.11.010}, doi = {10.1016/J.ORL.2003.11.010}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/EvenGKRS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/FleinerFI04, author = {Tam{\'{a}}s Fleiner and Andr{\'{a}}s Frank and Satoru Iwata}, title = {A constrained independent set problem for matroids}, journal = {Oper. Res. Lett.}, volume = {32}, number = {1}, pages = {23--26}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00063-4}, doi = {10.1016/S0167-6377(03)00063-4}, timestamp = {Wed, 16 May 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/FleinerFI04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/FreundJ04, author = {Roland W. Freund and Florian Jarre}, title = {A sensitivity result for semidefinite programs}, journal = {Oper. Res. Lett.}, volume = {32}, number = {2}, pages = {126--132}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00069-5}, doi = {10.1016/S0167-6377(03)00069-5}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/FreundJ04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Gavirneni04, author = {Srinagesh Gavirneni}, title = {Periodic review inventory control with fluctuating purchasing costs}, journal = {Oper. Res. Lett.}, volume = {32}, number = {4}, pages = {374--379}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.11.003}, doi = {10.1016/J.ORL.2003.11.003}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Gavirneni04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/GomesRS04, author = {Carla P. Gomes and Rommel G. Regis and David B. Shmoys}, title = {An improved approximation algorithm for the partial Latin square extension problem}, journal = {Oper. Res. Lett.}, volume = {32}, number = {5}, pages = {479--484}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.09.007}, doi = {10.1016/J.ORL.2003.09.007}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/GomesRS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/GrossoCT04, author = {Andrea Grosso and Federico Della Croce and Roberto Tadei}, title = {An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem}, journal = {Oper. Res. Lett.}, volume = {32}, number = {1}, pages = {68--72}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00064-6}, doi = {10.1016/S0167-6377(03)00064-6}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/orl/GrossoCT04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Gullu04, author = {Refik G{\"{u}}ll{\"{u}}}, title = {Analysis of an \emph{M}/\emph{G}/ queue with batch arrivals and batch-dedicated servers}, journal = {Oper. Res. Lett.}, volume = {32}, number = {5}, pages = {431--438}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.12.002}, doi = {10.1016/J.ORL.2003.12.002}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Gullu04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Hartvigsen04, author = {David Hartvigsen}, title = {Book review}, journal = {Oper. Res. Lett.}, volume = {32}, number = {4}, pages = {391--392}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.10.007}, doi = {10.1016/J.ORL.2003.10.007}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Hartvigsen04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/HeijdenHS04, author = {Matthieu van der Heijden and Aart van Harten and Andrei Sleptchenko}, title = {Approximations for Markovian multi-class queues with preemptive priorities}, journal = {Oper. Res. Lett.}, volume = {32}, number = {3}, pages = {273--282}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.09.001}, doi = {10.1016/J.ORL.2003.09.001}, timestamp = {Thu, 08 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/HeijdenHS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/HeydeK04, author = {Chris C. Heyde and S. G. Kou}, title = {On the controversy over tailweight of distributions}, journal = {Oper. Res. Lett.}, volume = {32}, number = {5}, pages = {399--408}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.10.011}, doi = {10.1016/J.ORL.2003.10.011}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/HeydeK04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Hochbaum04, author = {Dorit S. Hochbaum}, title = {Monotonizing linear programs with up to two nonzeroes per column}, journal = {Oper. Res. Lett.}, volume = {32}, number = {1}, pages = {49--58}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00074-9}, doi = {10.1016/S0167-6377(03)00074-9}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Hochbaum04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/HongCP04, author = {Sung{-}Pil Hong and Sung{-}Jin Chung and Bum Hwan Park}, title = {A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem}, journal = {Oper. Res. Lett.}, volume = {32}, number = {3}, pages = {233--239}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.06.003}, doi = {10.1016/J.ORL.2003.06.003}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/HongCP04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/HougaardK04, author = {Jens Leth Hougaard and Hans Keiding}, title = {Continuous benchmark selections}, journal = {Oper. Res. Lett.}, volume = {32}, number = {1}, pages = {94--98}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00073-7}, doi = {10.1016/S0167-6377(03)00073-7}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/HougaardK04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Huh04, author = {Woonghee Tim Huh}, title = {Finding 2-edge connected spanning subgraphs}, journal = {Oper. Res. Lett.}, volume = {32}, number = {3}, pages = {212--216}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.08.006}, doi = {10.1016/J.ORL.2003.08.006}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Huh04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/HurkensW04, author = {Cor A. J. Hurkens and Gerhard J. Woeginger}, title = {On the nearest neighbor rule for the traveling salesman problem}, journal = {Oper. Res. Lett.}, volume = {32}, number = {1}, pages = {1--4}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00093-2}, doi = {10.1016/S0167-6377(03)00093-2}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/HurkensW04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/JansD04, author = {Raf Jans and Zeger Degraeve}, title = {Improved lower bounds for the capacitated lot sizing problem with setup times}, journal = {Oper. Res. Lett.}, volume = {32}, number = {2}, pages = {185--195}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.06.001}, doi = {10.1016/J.ORL.2003.06.001}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/JansD04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/KahngR04, author = {Andrew B. Kahng and Sherief Reda}, title = {Match twice and stitch: a new {TSP} tour construction heuristic}, journal = {Oper. Res. Lett.}, volume = {32}, number = {6}, pages = {499--509}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2004.04.001}, doi = {10.1016/J.ORL.2004.04.001}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/orl/KahngR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/KattumanGB04, author = {P. A. Kattuman and R. J. Green and Janusz W. Bialek}, title = {Allocating electricity transmission costs through tracing: a game-theoretic rationale}, journal = {Oper. Res. Lett.}, volume = {32}, number = {2}, pages = {114--120}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00095-6}, doi = {10.1016/S0167-6377(03)00095-6}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/KattumanGB04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/KehaFN04, author = {Ahmet B. Keha and Ismael R. de Farias Jr. and George L. Nemhauser}, title = {Models for representing piecewise linear cost functions}, journal = {Oper. Res. Lett.}, volume = {32}, number = {1}, pages = {44--48}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00059-2}, doi = {10.1016/S0167-6377(03)00059-2}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/KehaFN04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Kharoufeh04, author = {Jeffrey P. Kharoufeh}, title = {Erratum to "Explicit results for wear processes in a Markovian environment" [Oper. Res. Lett. 31(3) {(2003)} 237-244]}, journal = {Oper. Res. Lett.}, volume = {32}, number = {2}, pages = {196}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00097-X}, doi = {10.1016/S0167-6377(03)00097-X}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Kharoufeh04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/KhullerK04, author = {Samir Khuller and Yoo Ah Kim}, title = {Equivalence of two linear programming relaxations for broadcast scheduling}, journal = {Oper. Res. Lett.}, volume = {32}, number = {5}, pages = {473--478}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.11.012}, doi = {10.1016/J.ORL.2003.11.012}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/KhullerK04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Kis04, author = {Tam{\'{a}}s Kis}, title = {On the complexity of the car sequencing problem}, journal = {Oper. Res. Lett.}, volume = {32}, number = {4}, pages = {331--335}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.09.003}, doi = {10.1016/J.ORL.2003.09.003}, timestamp = {Thu, 08 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Kis04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Koch04, author = {Thorsten Koch}, title = {The final N\({}_{\mbox{ETLIB}}\)-LP results}, journal = {Oper. Res. Lett.}, volume = {32}, number = {2}, pages = {138--142}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00094-4}, doi = {10.1016/S0167-6377(03)00094-4}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/orl/Koch04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/KonemannLPS04, author = {Jochen K{\"{o}}nemann and Yanjun Li and Ojas Parekh and Amitabh Sinha}, title = {An approximation algorithm for the edge-dilation \emph{k}-center problem\({}^{\mbox{, }}\)}, journal = {Oper. Res. Lett.}, volume = {32}, number = {5}, pages = {491--495}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.11.011}, doi = {10.1016/J.ORL.2003.11.011}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/KonemannLPS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/KoppeW04, author = {Matthias K{\"{o}}ppe and Robert Weismantel}, title = {Cutting planes from a mixed integer Farkas lemma}, journal = {Oper. Res. Lett.}, volume = {32}, number = {3}, pages = {207--211}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.08.003}, doi = {10.1016/J.ORL.2003.08.003}, timestamp = {Thu, 08 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/KoppeW04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Kordon04, author = {Alix Munier Kordon}, title = {Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay}, journal = {Oper. Res. Lett.}, volume = {32}, number = {6}, pages = {557--564}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.12.003}, doi = {10.1016/J.ORL.2003.12.003}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Kordon04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Laporte04, author = {Gilbert Laporte}, title = {Book review}, journal = {Oper. Res. Lett.}, volume = {32}, number = {4}, pages = {394--397}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.10.006}, doi = {10.1016/J.ORL.2003.10.006}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Laporte04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Lasserre04, author = {Jean B. Lasserre}, title = {Integer programming, Barvinok's counting algorithm and Gomory relaxations}, journal = {Oper. Res. Lett.}, volume = {32}, number = {2}, pages = {133--137}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00098-1}, doi = {10.1016/S0167-6377(03)00098-1}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/orl/Lasserre04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Lee04, author = {Jiyeon Lee}, title = {Asymptotics of overflow probabilities in Jackson networks}, journal = {Oper. Res. Lett.}, volume = {32}, number = {3}, pages = {265--272}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.07.002}, doi = {10.1016/J.ORL.2003.07.002}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Lee04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Lee04a, author = {Chung{-}Yee Lee}, title = {Inventory replenishment model: lot sizing versus just-in-time delivery}, journal = {Oper. Res. Lett.}, volume = {32}, number = {6}, pages = {581--590}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.12.008}, doi = {10.1016/J.ORL.2003.12.008}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Lee04a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Letchford04, author = {Adam N. Letchford}, title = {Book review}, journal = {Oper. Res. Lett.}, volume = {32}, number = {4}, pages = {393--394}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.10.005}, doi = {10.1016/J.ORL.2003.10.005}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/orl/Letchford04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Levin04, author = {Asaf Levin}, title = {A better approximation algorithm for the budget prize collecting tree problem}, journal = {Oper. Res. Lett.}, volume = {32}, number = {4}, pages = {316--319}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.11.002}, doi = {10.1016/J.ORL.2003.11.002}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Levin04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Levin04a, author = {Asaf Levin}, title = {Strongly polynomial-time approximation for a class of bicriteria problems}, journal = {Oper. Res. Lett.}, volume = {32}, number = {6}, pages = {530--534}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2004.02.002}, doi = {10.1016/J.ORL.2004.02.002}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Levin04a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/LocatelliBP04, author = {Marco Locatelli and Immanuel M. Bomze and Marcello Pelillo}, title = {The combinatorics of pivoting for the maximum weight clique}, journal = {Oper. Res. Lett.}, volume = {32}, number = {6}, pages = {523--529}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2004.02.005}, doi = {10.1016/J.ORL.2004.02.005}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/LocatelliBP04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/MarcotteSS04, author = {Patrice Marcotte and Gilles Savard and Fr{\'{e}}d{\'{e}}ric Semet}, title = {A bilevel programming approach to the travelling salesman problem}, journal = {Oper. Res. Lett.}, volume = {32}, number = {3}, pages = {240--248}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.08.005}, doi = {10.1016/J.ORL.2003.08.005}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/MarcotteSS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/MegowS04, author = {Nicole Megow and Andreas S. Schulz}, title = {On-line scheduling to minimize average completion time revisited}, journal = {Oper. Res. Lett.}, volume = {32}, number = {5}, pages = {485--490}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.11.008}, doi = {10.1016/J.ORL.2003.11.008}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/orl/MegowS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/MonnotPT04, author = {J{\'{e}}r{\^{o}}me Monnot and Vangelis Th. Paschos and Sophie Toulouse}, title = {Local approximations for maximum partial subgraph problem}, journal = {Oper. Res. Lett.}, volume = {32}, number = {3}, pages = {217--224}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.08.004}, doi = {10.1016/J.ORL.2003.08.004}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/MonnotPT04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/MontemanniGD04, author = {Roberto Montemanni and Luca Maria Gambardella and Alberto V. Donati}, title = {A branch and bound algorithm for the robust shortest path problem with interval data}, journal = {Oper. Res. Lett.}, volume = {32}, number = {3}, pages = {225--232}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.08.002}, doi = {10.1016/J.ORL.2003.08.002}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/MontemanniGD04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Muller04, author = {Rudolf M{\"{u}}ller}, title = {Book reviews}, journal = {Oper. Res. Lett.}, volume = {32}, number = {4}, pages = {390--391}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.11.001}, doi = {10.1016/J.ORL.2003.11.001}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Muller04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/MurotaSW04, author = {Kazuo Murota and Hiroo Saito and Robert Weismantel}, title = {Optimality criterion for a class of nonlinear integer programs}, journal = {Oper. Res. Lett.}, volume = {32}, number = {5}, pages = {468--472}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.11.007}, doi = {10.1016/J.ORL.2003.11.007}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/MurotaSW04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/MyungK04, author = {Young{-}Soo Myung and Hu{-}gon Kim}, title = {On the ring loading problem with demand splitting}, journal = {Oper. Res. Lett.}, volume = {32}, number = {2}, pages = {167--173}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.08.001}, doi = {10.1016/J.ORL.2003.08.001}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/MyungK04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/OrmeciB04, author = {E. Lerzan {\"{O}}rmeci and Apostolos Burnetas}, title = {Admission control with batch arrivals}, journal = {Oper. Res. Lett.}, volume = {32}, number = {5}, pages = {448--454}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2004.01.001}, doi = {10.1016/J.ORL.2004.01.001}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/orl/OrmeciB04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/PaulB04, author = {Anand A. Paul and Indranil Bose}, title = {Demand variability and incentives in inventory-based contracts}, journal = {Oper. Res. Lett.}, volume = {32}, number = {5}, pages = {409--414}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.12.004}, doi = {10.1016/J.ORL.2003.12.004}, timestamp = {Tue, 27 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/orl/PaulB04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/PaulG04, author = {Anand A. Paul and Genaro Gutierrez}, title = {Mean sample spacings, sample size and variability in an auction-theoretic framework}, journal = {Oper. Res. Lett.}, volume = {32}, number = {2}, pages = {103--108}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00071-3}, doi = {10.1016/S0167-6377(03)00071-3}, timestamp = {Tue, 27 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/orl/PaulG04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Pena04, author = {Javier Pe{\~{n}}a}, title = {Conic systems and sublinear mappings: equivalent approaches}, journal = {Oper. Res. Lett.}, volume = {32}, number = {5}, pages = {463--467}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.11.006}, doi = {10.1016/J.ORL.2003.11.006}, timestamp = {Tue, 29 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Pena04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Petrella04, author = {G. Petrella}, title = {An extension of the Euler Laplace transform inversion algorithm with applications in option pricing}, journal = {Oper. Res. Lett.}, volume = {32}, number = {4}, pages = {380--389}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.06.004}, doi = {10.1016/J.ORL.2003.06.004}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Petrella04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/PhilpottP04, author = {Andrew B. Philpott and Geoffrey Pritchard}, title = {Financial transmission rights in convex pool markets}, journal = {Oper. Res. Lett.}, volume = {32}, number = {2}, pages = {109--113}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.06.002}, doi = {10.1016/J.ORL.2003.06.002}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/PhilpottP04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Popova04, author = {Elmira Popova}, title = {Basic optimality results for Bayesian group replacement policies}, journal = {Oper. Res. Lett.}, volume = {32}, number = {3}, pages = {283--287}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.07.001}, doi = {10.1016/J.ORL.2003.07.001}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Popova04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/PrekopaH04, author = {Andr{\'{a}}s Pr{\'{e}}kopa and Xiaoling Hou}, title = {A stochastic programming model to find optimal sample sizes to estimate unknown parameters in an {LP}}, journal = {Oper. Res. Lett.}, volume = {32}, number = {1}, pages = {59--67}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00066-X}, doi = {10.1016/S0167-6377(03)00066-X}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/PrekopaH04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/PunnenA04, author = {Abraham P. Punnen and Yash P. Aneja}, title = {Lexicographic balanced optimization problems}, journal = {Oper. Res. Lett.}, volume = {32}, number = {1}, pages = {27--30}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00065-8}, doi = {10.1016/S0167-6377(03)00065-8}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/PunnenA04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/ReedSV04, author = {Bruce A. Reed and Kaleigh Smith and Adrian Vetta}, title = {Finding odd cycle transversals}, journal = {Oper. Res. Lett.}, volume = {32}, number = {4}, pages = {299--301}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.10.009}, doi = {10.1016/J.ORL.2003.10.009}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/orl/ReedSV04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Reinelt04, author = {Gerhard Reinelt}, title = {Book review}, journal = {Oper. Res. Lett.}, volume = {32}, number = {5}, pages = {497--498}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2004.01.003}, doi = {10.1016/J.ORL.2004.01.003}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Reinelt04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Rosenberg04, author = {Eric Rosenberg}, title = {The expected length of a random line segment in a rectangle}, journal = {Oper. Res. Lett.}, volume = {32}, number = {2}, pages = {99--102}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00072-5}, doi = {10.1016/S0167-6377(03)00072-5}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Rosenberg04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Rothblum04, author = {Uriel G. Rothblum}, title = {Tales of Hoffman}, journal = {Oper. Res. Lett.}, volume = {32}, number = {6}, pages = {591--594}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2004.03.003}, doi = {10.1016/J.ORL.2004.03.003}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Rothblum04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Rubin04, author = {Paul A. Rubin}, title = {Comment on "A nonlinear Lagrangian dual for integer programming"}, journal = {Oper. Res. Lett.}, volume = {32}, number = {2}, pages = {197--198}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00096-8}, doi = {10.1016/S0167-6377(03)00096-8}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Rubin04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Schafer04, author = {Uwe Sch{\"{a}}fer}, title = {On the modulus algorithm for the linear complementarity problem}, journal = {Oper. Res. Lett.}, volume = {32}, number = {4}, pages = {350--354}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.11.004}, doi = {10.1016/J.ORL.2003.11.004}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Schafer04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/SheraliL04, author = {Hanif D. Sherali and Churlzu Lim}, title = {On embedding the volume algorithm in a variable target value method}, journal = {Oper. Res. Lett.}, volume = {32}, number = {5}, pages = {455--462}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.12.006}, doi = {10.1016/J.ORL.2003.12.006}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/orl/SheraliL04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Shin04, author = {Y. W. Yang Woo Shin}, title = {\emph{BMAP}/\emph{G}/1 queue with correlated arrivals of customers and disasters}, journal = {Oper. Res. Lett.}, volume = {32}, number = {4}, pages = {364--373}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.09.005}, doi = {10.1016/J.ORL.2003.09.005}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Shin04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Shioura04, author = {Akiyoshi Shioura}, title = {The MA-ordering max-flow algorithm is not strongly polynomial for directed networks}, journal = {Oper. Res. Lett.}, volume = {32}, number = {1}, pages = {31--35}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00070-1}, doi = {10.1016/S0167-6377(03)00070-1}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Shioura04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Stee04, author = {Rob van Stee}, title = {An approximation algorithm for square packing}, journal = {Oper. Res. Lett.}, volume = {32}, number = {6}, pages = {535--539}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2004.02.003}, doi = {10.1016/J.ORL.2004.02.003}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Stee04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Sviridenko04, author = {Maxim Sviridenko}, title = {A note on maximizing a submodular set function subject to a knapsack constraint}, journal = {Oper. Res. Lett.}, volume = {32}, number = {1}, pages = {41--43}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00062-2}, doi = {10.1016/S0167-6377(03)00062-2}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Sviridenko04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Tamir04, author = {Arie Tamir}, title = {Sorting weighted distances with applications to objective function evaluations in single facility location problems}, journal = {Oper. Res. Lett.}, volume = {32}, number = {3}, pages = {249--257}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.10.004}, doi = {10.1016/J.ORL.2003.10.004}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Tamir04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/TercinetLN04, author = {Fabrice Tercinet and Christophe Lent{\'{e}} and Emmanuel N{\'{e}}ron}, title = {Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines}, journal = {Oper. Res. Lett.}, volume = {32}, number = {4}, pages = {326--330}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.08.008}, doi = {10.1016/J.ORL.2003.08.008}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/TercinetLN04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Tichy04, author = {Tom{\'{a}}s Tich{\'{y}}}, title = {Randomized on-line scheduling on three processors}, journal = {Oper. Res. Lett.}, volume = {32}, number = {2}, pages = {152--158}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.05.003}, doi = {10.1016/J.ORL.2003.05.003}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Tichy04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Vanderperre04, author = {Edmond J. Vanderperre}, title = {Reliability analysis of a renewable multiple cold standby system}, journal = {Oper. Res. Lett.}, volume = {32}, number = {3}, pages = {288--292}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.10.002}, doi = {10.1016/J.ORL.2003.10.002}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Vanderperre04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Velzen04, author = {Bas van Velzen}, title = {Dominating set games}, journal = {Oper. Res. Lett.}, volume = {32}, number = {6}, pages = {565--573}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2004.02.004}, doi = {10.1016/J.ORL.2004.02.004}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Velzen04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/WiermanBH04, author = {Adam Wierman and Nikhil Bansal and Mor Harchol{-}Balter}, title = {A note on comparing response times in the {M/GI/1/FB} and {M/GI/1/PS} queues}, journal = {Oper. Res. Lett.}, volume = {32}, number = {1}, pages = {73--76}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00061-0}, doi = {10.1016/S0167-6377(03)00061-0}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/orl/WiermanBH04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Woeginger04, author = {Gerhard J. Woeginger}, title = {Inapproximability results for no-wait job shop scheduling}, journal = {Oper. Res. Lett.}, volume = {32}, number = {4}, pages = {320--325}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.10.003}, doi = {10.1016/J.ORL.2003.10.003}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Woeginger04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/YehS04, author = {Yingchieh Yeh and Bruce W. Schmeiser}, title = {On the robustness of batching estimators}, journal = {Oper. Res. Lett.}, volume = {32}, number = {3}, pages = {293--298}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.09.002}, doi = {10.1016/J.ORL.2003.09.002}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/YehS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Zazanis04, author = {Michael A. Zazanis}, title = {Cycle times in single server cyclic Jackson networks}, journal = {Oper. Res. Lett.}, volume = {32}, number = {5}, pages = {422--430}, year = {2004}, url = {https://doi.org/10.1016/j.orl.2003.12.001}, doi = {10.1016/J.ORL.2003.12.001}, timestamp = {Thu, 08 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Zazanis04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/ZhangT04, author = {Zhe George Zhang and Naishuo Tian}, title = {The \emph{N} threshold policy for the \emph{GI}/\emph{M}/1 queue}, journal = {Oper. Res. Lett.}, volume = {32}, number = {1}, pages = {77--84}, year = {2004}, url = {https://doi.org/10.1016/S0167-6377(03)00067-1}, doi = {10.1016/S0167-6377(03)00067-1}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/ZhangT04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.