| 111 | -- | 114 | Alex R. Berg, Tibor Jordán. Sparse certificates and removable cycles in ::::l::::-mixed ::::p::::-connected graphs |
| 115 | -- | 120 | Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, Martin Skutella. Approximating ::::k::::-hop minimum-spanning trees |
| 121 | -- | 126 | Guochuan Zhang. A 3-approximation algorithm for two-dimensional bin packing |
| 127 | -- | 133 | Evgeny V. Shchepin, Nodari Vakhania. An optimal rounding gives a better approximation for scheduling unrelated machines |
| 134 | -- | 142 | 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 |
| 143 | -- | 150 | Aziz Moukrim, Alain Quilliot. Optimal preemptive scheduling on a fixed number of identical parallel machines |
| 151 | -- | 156 | Roel Leus, Willy Herroelen. The complexity of machine scheduling for stability with a single disrupted job |
| 157 | -- | 164 | Shuguang Li, Guojun Li, Xiaoli Wang, Qiming Liu. Minimizing makespan on a single batching machine with release times and non-identical job sizes |
| 165 | -- | 170 | Paolo Serafini. Linear programming with variable matrix entries |
| 171 | -- | 175 | Horand I. Gassmann, András Prékopa. On stages and consistency checks in stochastic programming |
| 176 | -- | 182 | Mark Lewis, Bahram Alidaee, Gary A. Kochenberger. Using ::::xQx:::: to model and solve the uncapacitated task allocation problem |
| 183 | -- | 186 | Hansjörg Albrecher. A note on the asymptotic behaviour of bottleneck problems |
| 187 | -- | 194 | Hong Chen, Yat-Wah Wan. Capacity competition of make-to-order firms |
| 195 | -- | 200 | Nikhil Bansal. On the average sojourn time under M/M/1/SRPT |
| 201 | -- | 209 | Yutaka Baba. Analysis of a GI/M/1 queue with multiple working vacations |
| 210 | -- | 215 | Gerhard J. Woeginger. Combinatorial approximation algorithms: a comparative review |
| 216 | -- | 217 | 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 |
| 217 | -- | 219 | Vitaly A. Strusevich. Hans Kellerer, Ulrich Pferschy and David Pisinger, ::::Knapsack Problems::::, Springer, Berlin (2004) ISBN 3-540-40286-1 546pp., EUR 99, 95 |
| 219 | -- | 220 | 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, Bost |