Operations Research Letters, Volume 33

Volume 33, Number 1, January 2005

• Christian Malchin, Hans Daduna:
  An invariance property of sojourn times in cyclic networks. 1-8
  
• Wendell G. Gilland:
  Analysis of optimal and nearly optimal sequencing policies for a closed queueing network. 9-16
  
• Tava Lennon Olsen, Robert D. van der Mei:
  Polling systems with periodic server routing in heavy traffic: renewal arrivals. 17-25
  
• Vladimir V. Anisimov:
  Asymptotic analysis of stochastic block replacement policies for multicomponent systems in a Markov environment. 26-34
  
• László Lipták, Levent Tunçel:
  Lift-and-project ranks and antiblocker duality. 35-41
  
• Tobias Achterberg, Thorsten Koch, Alexander Martin:
  Branching rules revisited. 42-54
  
• Warren P. Adams, Richard J. Forrester:
  A simple recipe for concise mixed 0-1 linearizations. 55-61
  
• Subhash C. Sarin, Hanif D. Sherali, Ajay Bhootra:
  New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints. 62-70
  
• Refael Hassin, Shlomi Rubinstein:
  On the complexity of the k-customer vehicle routing problem. 71-76
  
• Yupei Xiong, Bruce L. Golden, Edward A. Wasil:
  Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem. 77-80
  
• Erhan Erkut, Armann Ingolfsson:
  Transport risk models for hazardous materials: revisited. 81-89
  
• Peng Sheng You:
  Optimal replenishment policy for product with season pattern demand. 90-96
  
• Irwin E. Schochetman, Robert L. Smith:
  Existence of efficient solutions in infinite horizon optimization under continuous and discrete controls. 97-104
  
• Tamás Kis:
  Project scheduling: a review of recent books. 105-110
  

Volume 33, Number 2, March 2005

• Alex R. Berg, Tibor Jordán:
  Sparse certificates and removable cycles in l-mixed p-connected graphs. 111-114
  
• Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, Martin Skutella:
  Approximating k-hop minimum-spanning trees. 115-120
  
• Guochuan Zhang:
  A 3-approximation algorithm for two-dimensional bin packing. 121-126
  
• Evgeny V. Shchepin, Nodari Vakhania:
  An optimal rounding gives a better approximation for scheduling unrelated machines. 127-133
  
• Ramesh Bollapragada, Jeffrey D. Camm, Uday S. Rao, Junying Wu:
  A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access. 134-142
  
• Aziz Moukrim, Alain Quilliot:
  Optimal preemptive scheduling on a fixed number of identical parallel machines. 143-150
  
• Roel Leus, Willy Herroelen:
  The complexity of machine scheduling for stability with a single disrupted job. 151-156
  
• Shuguang Li, Guojun Li, Xiaoli Wang, Qiming Liu:
  Minimizing makespan on a single batching machine with release times and non-identical job sizes. 157-164
  
• Paolo Serafini:
  Linear programming with variable matrix entries. 165-170
  
• Horand I. Gassmann, András Prékopa:
  On stages and consistency checks in stochastic programming. 171-175
  
• Mark Lewis, Bahram Alidaee, Gary A. Kochenberger:
  Using xQx to model and solve the uncapacitated task allocation problem. 176-182
  
• Hansjörg Albrecher:
  A note on the asymptotic behaviour of bottleneck problems. 183-186
  
• Hong Chen, Yat-wah Wan:
  Capacity competition of make-to-order firms. 187-194
  
• Nikhil Bansal:
  On the average sojourn time under M/M/1/SRPT. 195-200
  
• Yutaka Baba:
  Analysis of a GI/M/1 queue with multiple working vacations. 201-209
  
• Gerhard J. Woeginger:
  Combinatorial approximation algorithms: a comparative review. 210-215
  
• A. Volgenant:
  In: Bernhard Korte and Jens Vygen, Editors, Combinatorial Optimization Theory and Algorithms, second ed., Algorithms and Combinatorics, vol 21, Springer, Berlin (2002) ISBN 3-540-43154-3 543pp. 216-217
  
• Vitaly A. Strusevich:
  Hans Kellerer, Ulrich Pferschy and David Pisinger, Knapsack Problems, Springer, Berlin (2004) ISBN 3-540-40286-1 546pp., EUR 99, 95. 217-219
  
• Nesim K. Erkip:
  In: Stanley B. Gershwin, Yves Dallery, Chrissoleon T. Papadopoulos and J. MacGregor Smith, Editors, Analysis and Modeling of Manufacturing Systems, International Series in OperationsResearch and Management Science, Kluwer Academic Publishers, Boston, Dordrecht, London (2003) ISBN 1-4020-7303-8 429pp. 219-220
  

Volume 33, Number 3, May 2005

• Mihály Bárász, Johanna Becker, András Frank:
  An algorithm for source location in directed graphs. 221-230
  
• David Pearson:
  A polynomial-time algorithm for the change-making problem. 231-234
  
• Ryuhei Miyashiro, Tomomi Matsui:
  A polynomial-time algorithm to find an equitable home-away assignment. 235-241
  
• Refael Hassin, Jérôme Monnot:
  The maximum saving partition problem. 242-248
  
• Satyaveer Singh Chauhan, Anton V. Eremeev, Anna A. Romanova, Vladimir V. Servakh, Gerhard J. Woeginger:
  Approximation of the supply scheduling problem. 249-254
  
• Jean-Louis Bouquard, Jean-Charles Billaut, Mikhail A. Kubzin, Vitaly A. Strusevich:
  Two-machine flow shop scheduling problems with no-wait jobs. 255-262
  
• Igor Averbakh, Oded Berman, Ilya Chernykh:
  The m-machine flowshop problem with unit-time operations and intree precedence constraints. 263-266
  
• Nikhil Bansal:
  Minimizing flow time on a constant number of machines with preemption. 267-273
  
• Ada Che, Chengbin Chu:
  A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line. 274-284
  
• Flip Klijn, Marco Slikker:
  Distribution center consolidation games. 285-288
  
• Xiaolong Zhang:
  Delayed demand information and dampened bullwhip effect. 289-294
  
• Tsuyoshi Katayama:
  Level-crossing approach to a time-limited service system with two types of vacations. 295-300
  
• Seyed M. R. Iravani, Bora Kolfal:
  When does the cµ rule apply to finite-population queueing systems? 301-304
  
• Alpár Jüttner:
  Optimization with additional variables and constraints. 305-311
  
• Oleg A. Prokopyev, Hong-Xuan Huang, Panos M. Pardalos:
  On complexity of unconstrained hyperbolic 0-1 programming problems. 312-318
  
• Garud Iyengar, Wanmo Kang:
  Inverse conic programming with applications. 319-330
  

Volume 33, Number 4, July 2005

• Mustafa Ç. Pinar, Reha H. Tütüncü:
  Robust profit opportunities in risky financial portfolios. 331-340
  
• Liwan H. Liyanage, J. George Shanthikumar:
  A practical inventory control policy using operational statistics. 341-348
  
• Guillermo Gallego, Özalp Özer:
  A new algorithm and a new heuristic for serial supply systems. 349-362
  
• Ward Whitt:
  Two fluid approximations for multi-server queues with abandonments. 363-372
  
• Benny Van Houdt, Attahiru Sule Alfa:
  Response time in a tandem queue with blocking, Markovian arrivals and phase-type services. 373-381
  
• Dániel Marx:
  A short proof of the NP-completeness of minimum sum interval coloring. 382-384
  
• David Avis, Caterina De Simone, Bruce A. Reed:
  On the fractional chromatic index of a graph and its complement. 385-388
  
• Masataka Nakamura:
  Characterizations of polygreedoids and poly-antimatroids by greedy algorithms. 389-394
  
• Pawel Winter, Martin Zachariasen:
  Two-connected Steiner networks: structural properties. 395-402
  
• Andreas Baltz, Anand Srivastav:
  Approximation algorithms for the Euclidean bipartite TSP. 403-410
  
• Raymond K. Cheung, Darren D. Hang, Ning Shi:
  A labeling method for dynamic driver-task assignment with uncertain task durations. 411-420
  
• S. M. R. Iravani, C. P. Teo:
  Asymptotically optimal schedules for single-server flow shop problems with setup costs and times. 421-430
  
• Adam Kasperski:
  Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion. 431-436
  
• László Lovász:
  Review of the book by Alexander Schrijver: Combinatorial Optimization: Polyhedra and Efficiency. 437-440
  

Volume 33, Number 5, September 2005

• Andreas Märkert, Rüdiger Schultz:
  On deviation measures in stochastic integer programming. 441-449
  
• S. Ilker Birbil, Shu-Cherng Fang, J. B. G. Frenk, Shuzhong Zhang:
  Recursive approximation of the high dimensional max function. 450-458
  
• Amit M. Bhosle:
  Improved algorithms for replacement paths problems in restricted graphs. 459-466
  
• David Gamarnik, Moshe Lewenstein, Maxim Sviridenko:
  An improved upper bound for the TSP in cubic 3-edge-connected graphs. 467-474
  
• Zvi Drezner:
  Compounded genetic algorithms for the quadratic assignment problem. 475-480
  
• Eduardo Conde:
  On the complexity of the continuous unbounded knapsack problem with uncertain coefficients. 481-485
  
• Wilco van den Heuvel, Albert P. M. Wagelmans:
  A comparison of methods for lot-sizing in a rolling horizon environment. 486-496
  
• Gur Mosheiov, Daniel Oron, Yaacov Ritov:
  Minimizing flow-time on a single machine with integer batch sizes. 497-501
  
• Bert Zwart, Sem C. Borst, Krzysztof Debicki:
  Reduced-load equivalence for Gaussian processes. 502-510
  
• Bert Zwart:
  Heavy-traffic asymptotics for the single-server queue with random order of service. 511-518
  
• Samuli Aalto, Urtzi Ayesta, Eeva Nyberg-Oksanen:
  M/G/1/MLPS compared to M/G/1/PS. 519-524
  
• Arunava Banerjee, Anand Paul:
  Average fill rate and horizon length. 525-530
  
• Xiaohu Li:
  A note on expected rent in auction theory. 531-534
  
• Lothar Breuer, Attahiru Sule Alfa:
  An EM algorithm for platoon arrival processes in discrete time. 535-543
  
• Bert Zwart:
  A new generation of applied probability textbooks. 544-550
  

Volume 33, Number 6, November 2005

• Werner R. W. Scheinhardt, Nicky D. van Foreest, Michel Mandjes:
  Continuous feedback fluid queues. 551-559
  
• Dimitra Pinotsi, Michael A. Zazanis:
  Synchronized queues with deterministic arrivals. 560-566
  
• Esa Hyytiä, Jorma T. Virtamo:
  Random waypoint model in n-dimensional space. 567-571
  
• Ananth V. Iyer, Vinayak Deshpande, Zhengping Wu:
  Contingency management under asymmetric information. 572-580
  
• Rogemar S. Mamon, Marianito R. Rodrigo:
  Explicit solutions to European options in a regime-switching economy. 581-586
  
• Berit Johannes:
  On the complexity of scheduling unit-time jobs with OR-precedence constraints. 587-596
  
• Christoph Ambühl, Monaldo Mastrolilli:
  On-line scheduling to minimize max flow time: an optimal preemptive algorithm. 597-602
  
• Frits C. R. Spieksma, Gerhard J. Woeginger:
  The no-wait flow-shop paradox. 603-608
  
• Zhenbo Wang, Wenxun Xing, Fengshan Bai:
  No-wait flexible flowshop scheduling with no-idle machines. 609-614
  
• Samir Elhedhli:
  Exact solution of a class of nonlinear knapsack problems. 615-624
  
• Adam N. Letchford, Nicholas A. Pearson:
  A fast algorithm for minimum weight odd circuits and cuts in planar graphs. 625-628
  
• Michael Laszlo, Sumitra Mukherjee:
  Another greedy heuristic for the constrained forest problem. 629-633
  
• Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten:
  Complexity of the min-max and min-max regret assignment problems. 634-640
  
• Justo Puerto, Antonio M. Rodríguez-Chía:
  On the exponential cardinality of FDS for the ordered p-median problem. 641-651
  

• Ruud H. Koning:
  Book review. 652-653
  
• Bo Chen:
  Book review. 653-654
  

Last update Sat May 25 20:54:56 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page