Volume 33,
Number 1,
January 2005
- Christian Malchin, Hans Daduna:
An invariance property of sojourn times in cyclic networks.
1-8
Electronic Edition (link) BibTeX
- Wendell G. Gilland:
Analysis of optimal and nearly optimal sequencing policies for a closed queueing network.
9-16
Electronic Edition (link) BibTeX
- Tava Lennon Olsen, Robert D. van der Mei:
Polling systems with periodic server routing in heavy traffic: renewal arrivals.
17-25
Electronic Edition (link) BibTeX
- Vladimir V. Anisimov:
Asymptotic analysis of stochastic block replacement policies for multicomponent systems in a Markov environment.
26-34
Electronic Edition (link) BibTeX
- László Lipták, Levent Tunçel:
Lift-and-project ranks and antiblocker duality.
35-41
Electronic Edition (link) BibTeX
- Tobias Achterberg, Thorsten Koch, Alexander Martin:
Branching rules revisited.
42-54
Electronic Edition (link) BibTeX
- Warren P. Adams, Richard J. Forrester:
A simple recipe for concise mixed 0-1 linearizations.
55-61
Electronic Edition (link) BibTeX
- 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
Electronic Edition (link) BibTeX
- Refael Hassin, Shlomi Rubinstein:
On the complexity of the k-customer vehicle routing problem.
71-76
Electronic Edition (link) BibTeX
- Yupei Xiong, Bruce L. Golden, Edward A. Wasil:
Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem.
77-80
Electronic Edition (link) BibTeX
- Erhan Erkut, Armann Ingolfsson:
Transport risk models for hazardous materials: revisited.
81-89
Electronic Edition (link) BibTeX
- Peng Sheng You:
Optimal replenishment policy for product with season pattern demand.
90-96
Electronic Edition (link) BibTeX
- Irwin E. Schochetman, Robert L. Smith:
Existence of efficient solutions in infinite horizon optimization under continuous and discrete controls.
97-104
Electronic Edition (link) BibTeX
- Tamás Kis:
Project scheduling: a review of recent books.
105-110
Electronic Edition (link) BibTeX
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
Electronic Edition (link) BibTeX
- Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, Martin Skutella:
Approximating k-hop minimum-spanning trees.
115-120
Electronic Edition (link) BibTeX
- Guochuan Zhang:
A 3-approximation algorithm for two-dimensional bin packing.
121-126
Electronic Edition (link) BibTeX
- Evgeny V. Shchepin, Nodari Vakhania:
An optimal rounding gives a better approximation for scheduling unrelated machines.
127-133
Electronic Edition (link) BibTeX
- 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
Electronic Edition (link) BibTeX
- Aziz Moukrim, Alain Quilliot:
Optimal preemptive scheduling on a fixed number of identical parallel machines.
143-150
Electronic Edition (link) BibTeX
- Roel Leus, Willy Herroelen:
The complexity of machine scheduling for stability with a single disrupted job.
151-156
Electronic Edition (link) BibTeX
- 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
Electronic Edition (link) BibTeX
- Paolo Serafini:
Linear programming with variable matrix entries.
165-170
Electronic Edition (link) BibTeX
- Horand I. Gassmann, András Prékopa:
On stages and consistency checks in stochastic programming.
171-175
Electronic Edition (link) BibTeX
- Mark Lewis, Bahram Alidaee, Gary A. Kochenberger:
Using xQx to model and solve the uncapacitated task allocation problem.
176-182
Electronic Edition (link) BibTeX
- Hansjörg Albrecher:
A note on the asymptotic behaviour of bottleneck problems.
183-186
Electronic Edition (link) BibTeX
- Hong Chen, Yat-wah Wan:
Capacity competition of make-to-order firms.
187-194
Electronic Edition (link) BibTeX
- Nikhil Bansal:
On the average sojourn time under M/M/1/SRPT.
195-200
Electronic Edition (link) BibTeX
- Yutaka Baba:
Analysis of a GI/M/1 queue with multiple working vacations.
201-209
Electronic Edition (link) BibTeX
- Gerhard J. Woeginger:
Combinatorial approximation algorithms: a comparative review.
210-215
Electronic Edition (link) BibTeX
- 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
Electronic Edition (link) BibTeX
- 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
Electronic Edition (link) BibTeX
- Nesim 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
Electronic Edition (link) BibTeX
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
Electronic Edition (link) BibTeX
- David Pearson:
A polynomial-time algorithm for the change-making problem.
231-234
Electronic Edition (link) BibTeX
- Ryuhei Miyashiro, Tomomi Matsui:
A polynomial-time algorithm to find an equitable home-away assignment.
235-241
Electronic Edition (link) BibTeX
- Refael Hassin, Jérôme Monnot:
The maximum saving partition problem.
242-248
Electronic Edition (link) BibTeX
- Satyaveer Singh Chauhan, Anton V. Eremeev, Anna A. Romanova, Vladimir V. Servakh, Gerhard J. Woeginger:
Approximation of the supply scheduling problem.
249-254
Electronic Edition (link) BibTeX
- Jean-Louis Bouquard, Jean-Charles Billaut, Mikhail A. Kubzin, Vitaly A. Strusevich:
Two-machine flow shop scheduling problems with no-wait jobs.
255-262
Electronic Edition (link) BibTeX
- Igor Averbakh, Oded Berman, Ilya Chernykh:
The m-machine flowshop problem with unit-time operations and intree precedence constraints.
263-266
Electronic Edition (link) BibTeX
- Nikhil Bansal:
Minimizing flow time on a constant number of machines with preemption.
267-273
Electronic Edition (link) BibTeX
- Ada Che, Chengbin Chu:
A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line.
274-284
Electronic Edition (link) BibTeX
- Flip Klijn, Marco Slikker:
Distribution center consolidation games.
285-288
Electronic Edition (link) BibTeX
- Xiaolong Zhang:
Delayed demand information and dampened bullwhip effect.
289-294
Electronic Edition (link) BibTeX
- Tsuyoshi Katayama:
Level-crossing approach to a time-limited service system with two types of vacations.
295-300
Electronic Edition (link) BibTeX
- Seyed M. R. Iravani, Bora Kolfal:
When does the cµ rule apply to finite-population queueing systems?
301-304
Electronic Edition (link) BibTeX
- Alpár Jüttner:
Optimization with additional variables and constraints.
305-311
Electronic Edition (link) BibTeX
- Oleg A. Prokopyev, Hong-Xuan Huang, Panos M. Pardalos:
On complexity of unconstrained hyperbolic 0-1 programming problems.
312-318
Electronic Edition (link) BibTeX
- Garud Iyengar, Wanmo Kang:
Inverse conic programming with applications.
319-330
Electronic Edition (link) BibTeX
Volume 33,
Number 4,
July 2005
- Mustafa Ç. Pinar, Reha H. Tütüncü:
Robust profit opportunities in risky financial portfolios.
331-340
Electronic Edition (link) BibTeX
- Liwan H. Liyanage, J. George Shanthikumar:
A practical inventory control policy using operational statistics.
341-348
Electronic Edition (link) BibTeX
- Guillermo Gallego, Özalp Özer:
A new algorithm and a new heuristic for serial supply systems.
349-362
Electronic Edition (link) BibTeX
- Ward Whitt:
Two fluid approximations for multi-server queues with abandonments.
363-372
Electronic Edition (link) BibTeX
- Benny Van Houdt, Attahiru Sule Alfa:
Response time in a tandem queue with blocking, Markovian arrivals and phase-type services.
373-381
Electronic Edition (link) BibTeX
- Dániel Marx:
A short proof of the NP-completeness of minimum sum interval coloring.
382-384
Electronic Edition (link) BibTeX
- David Avis, Caterina De Simone, Bruce A. Reed:
On the fractional chromatic index of a graph and its complement.
385-388
Electronic Edition (link) BibTeX
- Masataka Nakamura:
Characterizations of polygreedoids and poly-antimatroids by greedy algorithms.
389-394
Electronic Edition (link) BibTeX
- Pawel Winter, Martin Zachariasen:
Two-connected Steiner networks: structural properties.
395-402
Electronic Edition (link) BibTeX
- Andreas Baltz, Anand Srivastav:
Approximation algorithms for the Euclidean bipartite TSP.
403-410
Electronic Edition (link) BibTeX
- Raymond K. Cheung, Darren D. Hang, Ning Shi:
A labeling method for dynamic driver-task assignment with uncertain task durations.
411-420
Electronic Edition (link) BibTeX
- S. M. R. Iravani, C. P. Teo:
Asymptotically optimal schedules for single-server flow shop problems with setup costs and times.
421-430
Electronic Edition (link) BibTeX
- Adam Kasperski:
Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion.
431-436
Electronic Edition (link) BibTeX
- László Lovász:
Review of the book by Alexander Schrijver: Combinatorial Optimization: Polyhedra and Efficiency.
437-440
Electronic Edition (link) BibTeX
Volume 33,
Number 5,
September 2005
- Andreas Märkert, Rüdiger Schultz:
On deviation measures in stochastic integer programming.
441-449
Electronic Edition (link) BibTeX
- S. Ilker Birbil, Shu-Cherng Fang, J. B. G. Frenk, Shuzhong Zhang:
Recursive approximation of the high dimensional max function.
450-458
Electronic Edition (link) BibTeX
- Amit M. Bhosle:
Improved algorithms for replacement paths problems in restricted graphs.
459-466
Electronic Edition (link) BibTeX
- David Gamarnik, Moshe Lewenstein, Maxim Sviridenko:
An improved upper bound for the TSP in cubic 3-edge-connected graphs.
467-474
Electronic Edition (link) BibTeX
- Zvi Drezner:
Compounded genetic algorithms for the quadratic assignment problem.
475-480
Electronic Edition (link) BibTeX
- Eduardo Conde:
On the complexity of the continuous unbounded knapsack problem with uncertain coefficients.
481-485
Electronic Edition (link) BibTeX
- Wilco van den Heuvel, Albert P. M. Wagelmans:
A comparison of methods for lot-sizing in a rolling horizon environment.
486-496
Electronic Edition (link) BibTeX
- Gur Mosheiov, Daniel Oron, Yaacov Ritov:
Minimizing flow-time on a single machine with integer batch sizes.
497-501
Electronic Edition (link) BibTeX
- Bert Zwart, Sem C. Borst, Krzysztof Debicki:
Reduced-load equivalence for Gaussian processes.
502-510
Electronic Edition (link) BibTeX
- Bert Zwart:
Heavy-traffic asymptotics for the single-server queue with random order of service.
511-518
Electronic Edition (link) BibTeX
- Samuli Aalto, Urtzi Ayesta, Eeva Nyberg-Oksanen:
M/G/1/MLPS compared to M/G/1/PS.
519-524
Electronic Edition (link) BibTeX
- Arunava Banerjee, Anand Paul:
Average fill rate and horizon length.
525-530
Electronic Edition (link) BibTeX
- Xiaohu Li:
A note on expected rent in auction theory.
531-534
Electronic Edition (link) BibTeX
- Lothar Breuer, Attahiru Sule Alfa:
An EM algorithm for platoon arrival processes in discrete time.
535-543
Electronic Edition (link) BibTeX
- Bert Zwart:
A new generation of applied probability textbooks.
544-550
Electronic Edition (link) BibTeX
Volume 33,
Number 6,
November 2005
- Werner R. W. Scheinhardt, Nicky D. van Foreest, Michel Mandjes:
Continuous feedback fluid queues.
551-559
Electronic Edition (link) BibTeX
- Dimitra Pinotsi, Michael A. Zazanis:
Synchronized queues with deterministic arrivals.
560-566
Electronic Edition (link) BibTeX
- Esa Hyytiä, Jorma T. Virtamo:
Random waypoint model in n-dimensional space.
567-571
Electronic Edition (link) BibTeX
- Ananth V. Iyer, Vinayak Deshpande, Zhengping Wu:
Contingency management under asymmetric information.
572-580
Electronic Edition (link) BibTeX
- Rogemar S. Mamon, Marianito R. Rodrigo:
Explicit solutions to European options in a regime-switching economy.
581-586
Electronic Edition (link) BibTeX
- Berit Johannes:
On the complexity of scheduling unit-time jobs with OR-precedence constraints.
587-596
Electronic Edition (link) BibTeX
- Christoph Ambühl, Monaldo Mastrolilli:
On-line scheduling to minimize max flow time: an optimal preemptive algorithm.
597-602
Electronic Edition (link) BibTeX
- Frits C. R. Spieksma, Gerhard J. Woeginger:
The no-wait flow-shop paradox.
603-608
Electronic Edition (link) BibTeX
- Zhenbo Wang, Wenxun Xing, Fengshan Bai:
No-wait flexible flowshop scheduling with no-idle machines.
609-614
Electronic Edition (link) BibTeX
- Samir Elhedhli:
Exact solution of a class of nonlinear knapsack problems.
615-624
Electronic Edition (link) BibTeX
- Adam N. Letchford, Nicholas A. Pearson:
A fast algorithm for minimum weight odd circuits and cuts in planar graphs.
625-628
Electronic Edition (link) BibTeX
- Michael Laszlo, Sumitra Mukherjee:
Another greedy heuristic for the constrained forest problem.
629-633
Electronic Edition (link) BibTeX
- Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten:
Complexity of the min-max and min-max regret assignment problems.
634-640
Electronic Edition (link) BibTeX
- Justo Puerto, Antonio M. Rodríguez-Chía:
On the exponential cardinality of FDS for the ordered p-median problem.
641-651
Electronic Edition (link) BibTeX
Book reviews
Copyright © Tue May 27 18:33:02 2008
by Michael Ley (ley@uni-trier.de)
