Volume 31,
Number 1,
January 2003
- Wolfgang Stadje:
Renewal analysis of a replacement process.
1-6
- Mark Voorneveld:
Characterization of Pareto dominance.
7-11
- Tobias Polzin, Siavash Vahdati Daneshmand:
On Steiner trees and minimum spanning trees in hypergraphs.
12-20
- Marie-Christine Costa, Lucas Létocart, Frédéric Roupin:
A greedy algorithm for multicut and integral multiflow in rooted trees.
21-27
- Tjark Vredeveld, Jan Karel Lenstra:
On local search for the generalized graph coloring problem.
28-34
- Hans Kellerer, Vladimir Kotov:
An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing.
35-41
- Zhaohui Liu, Jinjiang Yuan, T. C. Edwin Cheng:
On scheduling an unbounded batch machine.
42-48
- Mohamed Haouari, Anis Gharbi:
An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines.
49-52
- Stefan Chanas, Pawel Zielinski:
On the hardness of evaluating criticality of activities in a planar network with duration intervals.
53-59
- Rafael Herrerías Pleguezuelo, José García Pérez, Salvador Cruz Rambaud:
A note on the reasonableness of PERT hypotheses.
60-62
- Steven A. Lippman, Kevin F. McCardle:
Comparative statics of cell phone plans.
63-65
- Huseyin Topaloglu, Warren B. Powell:
An algorithm for approximating piecewise linear concave functions from sample gradients.
66-76
- Torpong Cheevaprawatdomrong, Robert L. Smith:
A paradox in equipment replacement under technological improvement.
77-82
Volume 31,
Number 2,
March 2003
- Shane G. Henderson, Peter W. Glynn:
Nonexistence of a class of variate generation schemes.
83-89
- Alfred Müller:
On the interplay between variability and negative dependence for bivariate distributions.
90-94
- Krishnan Kumaran, Michel Mandjes, Alexander L. Stolyar:
Convexity properties of loss and overflow functions.
95-100
- Mohan L. Chaudhry, Nam K. Kim:
A complete and simple solution for a discrete-time multi-server queue with bulk arrivals and deterministic service times.
101-107
- Alexander N. Dudin, Valentina I. Klimenok:
Optimal admission control in a queueing system with heterogeneous traffic.
108-118
- Jiahua Chen, Dennis K. J. Lin, Douglas J. Thomas:
On the single item fill rate for a finite horizon.
119-123
- Jesús M. Jorge:
Maximal descriptor set characterizations of efficient faces in multiple objective linear programming.
124-128
- Peter Brucker, Silvia Heitmann, Johann Hurink:
How useful are preemptive schedules?
129-136
- Cor A. J. Hurkens, Tjark Vredeveld:
Local search for multiprocessor scheduling: how many moves does it take to a local optimum?
137-141
- Federico Della Croce, Vincent T'Kindt:
Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
142-148
- Stefano Pallottino, Maria Grazia Scutellà:
A new algorithm for reoptimizing shortest paths when the arc costs change.
149-160
- Liping Zhang:
On the convergence of a modified algorithm for the spherical facility location problem.
161-166
Volume 31,
Number 3,
May 2003
- Amir Beck, Marc Teboulle:
Mirror descent and nonlinear projected subgradient methods for convex optimization.
167-175
- Satoru Fujishige:
A maximum flow algorithm using MA ordering.
176-178
- Refael Hassin, Shlomi Rubinstein:
Approximation algorithms for the metric maximum clustering problem with given cluster sizes.
179-184
- Ravindra K. Ahuja, James B. Orlin, Dushyant Sharma:
A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
185-194
- Tobias Brüggemann, Jérôme Monnot, Gerhard J. Woeginger:
Local search for the minimum label spanning tree problem with bounded color classes.
195-201
- James M. Calvin, Joseph Y.-T. Leung:
Average-case analysis of a greedy algorithm for the 0/1 knapsack problem.
202-210
- Laureano F. Escudero, María Araceli Garín, Gloria Pérez:
An O(n log n) procedure for identifying facets of the knapsack polytope.
211-218
- 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.
219-224
- Sixiang Hou, Han Hoogeveen:
The three-machine proportionate flow shop problem with unequal machine speeds.
225-231
- Xiwen Lu, René Sitters, Leen Stougie:
A class of on-line scheduling algorithms to minimize total completion time.
232-236
- Jeffrey P. Kharoufeh:
Explicit results for wear processes in a Markovian environment.
237-244
Volume 31,
Issue 4,
July 2003
- Fred Glover, Hanif D. Sherali:
Foundation-penalty cuts for mixed-integer programs.
245-253
- Sem C. Borst, Onno J. Boxma, John A. Morrison, R. Núñez Queija:
The equivalence between processor sharing and service in random order.
254-262
- Attahiru Sule Alfa:
Waiting time distribution of the MAP/D/k system in discrete time - a more efficient algorithm.
263-267
- Seung-Min Lee:
On the characterization of continuum structure functions.
268-272
- Michele Conforti, Refael Hassin, R. Ravi:
Reconstructing edge-disjoint paths.
273-276
- Herminia I. Calvete, Lourdes del Pozo:
The quickest path problem with batch constraints.
277-284
- Bahar Yetis Kara, Erhan Erkut, Vedat Verter:
Accurate calculation of hazardous materials transport risks.
285-292
- Jose Antonio Barcia Gomez, José Miguel Díaz-Báñez, Antonio Jose Lozano, Inmaculada Ventura:
Computing an obnoxious anchored segment.
293-300
- Young-Gun G, Young-Jo Seong, Maing-Kyu Kang:
A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
301-307
- Christoph J. Schuster, Jose M. Framiñan:
Approximative procedures for no-wait job shop scheduling.
308-318
- T. C. Edwin Cheng, Zhaohui Liu:
Approximability of two-machine no-wait flowshop scheduling with availability constraints.
319-322
- 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.
323-326
Volume 31,
Issue 5,
September 2003
- Chi Kin Chau, Kwang Mong Sim:
The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands.
327-334
- Geir Dahl, Njål Foldnes:
Complete description of a class of knapsack polytopes.
335-340
- Paulo Bárcia, J. Orestes Cerdeira:
Node packings on cocomparability graphs.
341-342
- Matthias Elf, Michael Jünger, Giovanni Rinaldi:
Minimizing breaks by maximizing cuts.
343-349
- Marcus Oswald, Gerhard Reinelt:
The weighted consecutive ones problem for a fixed number of rows or columns.
350-356
- David Ben-Arieh, Gregory Gutin, M. Penn, Anders Yeo, Alexey Zverovich:
Transformations of generalized ATSP into ATSP.
357-365
- 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.
366-374
- Shane G. Henderson:
Estimation for nonhomogeneous Poisson processes from aggregated data.
375-382
- Jacques Resing, E. Lerzan Örmeci:
A tandem queueing model with coupled processors.
383-389
- Philipp Afèche:
Delay performance in stochastic processing networks with priority service.
390-400
- Nikhil Bansal:
Analysis of the M/G/1 processor-sharing queue with bulk arrivals.
401-405
- Hiroyuki Masuyama, Tetsuya Takine:
Sojourn time distribution in a MAP/M/1 processor-sharing queue.
406-412
Volume 31,
Issue 6,
November 2003
Last update Mon Feb 13 04:55:08 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
