Volume 82,
1998
- Maurice Queyranne:
Minimizing symmetric submodular functions.
3-12
- Harold N. Gabow, Michel X. Goemans, David P. Williamson:
An efficient approximation algorithm for the survivable network design problem.
13-40
- David R. Karger:
Random sampling and greedy sparsification for matroid optimization problems.
41-81
- Harold N. Gabow, K. S. Manu:
Packing algorithms for arborescences (and spanning trees) in capacitated graphs.
83-109
- Michel X. Goemans, Jon M. Kleinberg:
An improved approximation ratio for the minimum latency problem.
111-124
- Rainer E. Burkard, Eranda Çela, Günter Rote, Gerhard J. Woeginger:
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases.
125-158
- Rainer Schrader, Andreas S. Schulz, Georg Wambach:
Base polytopes of series-parallel posets: Linear description and optimization.
159-173
- Leslie A. Hall:
Approximability of flow shop scheduling.
175-190
- Sergey V. Sevastianov, Gerhard J. Woeginger:
Makespan minimization in open shops: A polynomial time approximation scheme.
191-198
- Cynthia A. Phillips, Clifford Stein, Joel Wein:
Minimizing average completion time in the presence of release dates.
199-223
- Arjen P. A. Vestjens:
Scheduling uniform machines on-line requires nondecreasing speed ratios.
225-234
- Jack A. A. van der Veen, Gerhard J. Woeginger, Shuzhong Zhang:
Sequencing jobs that require common resources on a single machine: A solvable case of the TSP.
235-254
- Bo Chen, Chris N. Potts, Vitaly A. Strusevich:
Approximation algorithms for two-machine flow shop scheduling with batch setup times.
255-271
- Han Hoogeveen, Steef L. van de Velde:
Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine.
273-289
- Nimrod Megiddo, Shinji Mizuno, Takashi Tsuchiya:
A modified layered-step interior-point algorithm for linear programming.
339-355
- Kazuo Murota:
Fenchel-type duality for matroid valuations.
357-375
- Ali Bouaricha, Robert B. Schnabel:
Tensor methods for large sparse systems of nonlinear equations.
377-400
- G. S. R. Murthy, T. Parthasarathy:
Fully copositive matrices.
401-411
- Peter Spellucci:
An SQP method for general nonlinear programs using only equality constrained subproblems.
413-448
Copyright © Sat Nov 14 06:09:45 2009
by Michael Ley (ley@uni-trier.de)
