| 167 | -- | 175 | Amir Beck, Marc Teboulle. Mirror descent and nonlinear projected subgradient methods for convex optimization |
| 176 | -- | 178 | Satoru Fujishige. A maximum flow algorithm using MA ordering |
| 179 | -- | 184 | Refael Hassin, Shlomi Rubinstein. Approximation algorithms for the metric maximum clustering problem with given cluster sizes |
| 185 | -- | 194 | Ravindra K. Ahuja, James B. Orlin, Dushyant Sharma. A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem |
| 195 | -- | 201 | Tobias Brüggemann, Jérôme Monnot, Gerhard J. Woeginger. Local search for the minimum label spanning tree problem with bounded color classes |
| 202 | -- | 210 | James M. Calvin, Joseph Y.-T. Leung. Average-case analysis of a greedy algorithm for the 0/1 knapsack problem |
| 211 | -- | 218 | Laureano F. Escudero, Araceli Garín, Gloria Pérez. An O(n log n) procedure for identifying facets of the knapsack polytope |
| 219 | -- | 224 | Marjan van den Akker, Han Hoogeveen, Gerhard J. Woeginger. The two-machine open shop problem: To fit or not to fit, that is the question |
| 225 | -- | 231 | Sixiang Hou, Han Hoogeveen. The three-machine proportionate flow shop problem with unequal machine speeds |
| 232 | -- | 236 | Xiwen Lu, René Sitters, Leen Stougie. A class of on-line scheduling algorithms to minimize total completion time |
| 237 | -- | 244 | Jeffrey P. Kharoufeh. Explicit results for wear processes in a Markovian environment |
| 245 | -- | 253 | Fred Glover, Hanif D. Sherali. Foundation-penalty cuts for mixed-integer programs |
| 254 | -- | 262 | Sem C. Borst, Onno J. Boxma, John A. Morrison, R. Núñez Queija. The equivalence between processor sharing and service in random order |
| 263 | -- | 267 | Attahiru Sule Alfa. Waiting time distribution of the MAP/D/k system in discrete time - a more efficient algorithm |
| 273 | -- | 276 | Michele Conforti, Refael Hassin, R. Ravi. Reconstructing edge-disjoint paths |
| 277 | -- | 284 | Herminia I. Calvete, Lourdes del Pozo. The quickest path problem with batch constraints |
| 285 | -- | 292 | Bahar Yetis Kara, Erhan Erkut, Vedat Verter. Accurate calculation of hazardous materials transport risks |
| 293 | -- | 300 | Jose Antonio Barcia Gomez, José Miguel Díaz-Báñez, Antonio Jose Lozano, Inmaculada Ventura. Computing an obnoxious anchored segment |
| 301 | -- | 307 | Young-Gun G, Young-Jo Seong, Maing-Kyu Kang. A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems |
| 308 | -- | 318 | Christoph J. Schuster, Jose M. Framinan. Approximative procedures for no-wait job shop scheduling |
| 319 | -- | 322 | T. C. Edwin Cheng, Zhaohui Liu. Approximability of two-machine no-wait flowshop scheduling with availability constraints |
| 323 | -- | 326 | C. T. Ng, T. C. Edwin Cheng, J. J. Yuan, Zhaohui Liu. On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times |
| 327 | -- | 334 | Chi-Kin Chau, Kwang Mong Sim. The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands |
| 335 | -- | 340 | Geir Dahl, Njål Foldnes. Complete description of a class of knapsack polytopes |
| 341 | -- | 342 | Paulo Bárcia, J. Orestes Cerdeira. Node packings on cocomparability graphs |
| 343 | -- | 349 | Matthias Elf, Michael Jünger, Giovanni Rinaldi. Minimizing breaks by maximizing cuts |
| 350 | -- | 356 | Marcus Oswald, Gerhard Reinelt. The weighted consecutive ones problem for a fixed number of rows or columns |
| 357 | -- | 365 | David Ben-Arieh, Gregory Gutin, M. Penn, Anders Yeo, Alexey Zverovich. Transformations of generalized ATSP into ATSP |
| 366 | -- | 374 | Woonghee Tim Huh, Ganesh Janakiraman, Peter L. Jackson, Nidhi Sawhney. Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: the bottleneck lower bound |
| 375 | -- | 382 | Shane G. Henderson. Estimation for nonhomogeneous Poisson processes from aggregated data |
| 383 | -- | 389 | Jacques Resing, Lerzan Örmeci. A tandem queueing model with coupled processors |
| 390 | -- | 400 | Philipp Afèche. Delay performance in stochastic processing networks with priority service |
| 401 | -- | 405 | Nikhil Bansal. Analysis of the M/G/1 processor-sharing queue with bulk arrivals |
| 406 | -- | 412 | Hiroyuki Masuyama, Tetsuya Takine. Sojourn time distribution in a MAP/M/1 processor-sharing queue |
| 413 | -- | 419 | Marc Uetz. When greediness fails: examples from stochastic scheduling |
| 420 | -- | 428 | Michael O. Ball, Chien-Yu Chen, Zhen-Ying Zhao. Material compatibility constraints for make-to-order production planning |
| 429 | -- | 434 | Paolo Ventura, Friedrich Eisenbrand. A compact linear program for testing optimality of perfect matchings |
| 435 | -- | 441 | Yann Kieffer. The facets of the polytope of modules of a graph |
| 442 | -- | 444 | Jan Brinkhuis. On the complexity of the primal self-concordant barrier method |
| 445 | -- | 450 | Monica Bianchi, Rita Pini. A note on stability for parametric equilibrium problems |
| 451 | -- | 458 | David Perry, Wolfgang Stadje. Duality of dams via mountain processes |
| 459 | -- | 461 | Yong J. Kim, Michael V. Mannino. Optimal incentive-compatible pricing for M/G/1 queues |
| 462 | -- | 472 | Hans Daduna, Ryszard Szekli. Dependence structure of sojourn times via partition separated ordering |
| 473 | -- | 476 | Mohammed Abbad, Hatim Boustique. A decomposition algorithm for limiting average Markov decision problems |
| 477 | -- | 482 | Jun Zhang. Managing multi-customer service level requirements with a simple rationing policy |
| 483 | -- | 491 | George L. Vairaktarakis. On Gilmore-Gomory s open question for the bottleneck TSP |
| 492 | -- | 496 | Yunpeng Pan. An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time |