Abstract is missing.
- Colourful Linear ProgrammingImre Bárány, Shmuel Onn. 1-15
- Test Sets and Inequalities for Integer ProgramsRekha R. Thomas, Robert Weismantel. 16-30
- An Optimal, Stable Continued Fraction AlgorithmCarsten Rössner, Claus-Peter Schnorr. 31-43
- Algorithms and Extended Formulations for One and Two Facility Network DesignSunil Chopra, Itzhak Gilboa, S. Trilochan Sastry. 44-57
- Integer Muticommodity Flow ProblemsCynthia Barnhart, Christopher A. Hane, Pamela H. Vance. 58-71
- A Heuristic Algorithm for the Set Covering ProblemAlberto Caprara, Matteo Fischetti, Paolo Toth. 72-84
- A epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow ProblemsPaul Tseng, Dimitri P. Bertsekas. 85-93
- Finding Real-Valued Single-Source Shortest PathsStavros G. Kolliopoulos, Clifford Stein. 94-104
- A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning TreesSándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young. 105-117
- Approximating ::::k::::-Set Cover and Complementary Graph ColoringMagnús M. Halldórsson. 118-131
- On Minimum 3-Cuts and Approximating ::::k::::-Cuts Using Cut TreesSanjiv Kapoor. 132-146
- Primal-Dual Approximation Algorithms for Feedback ProblemsMichel X. Goemans, David P. Williamson. 147-161
- Cone-LP s and Semidefinite Programs: GeometryGábor Pataki. 162-174
- Quadratic Knapsack Relaxations Using Cutting PlanesChristoph Helmberg, Franz Rendl, Robert Weismantel. 175-189
- A Semidefinite Bound for Mixing Rates of Markov ChainsNabil Kahale. 190-203
- The Quadratic Assignment Problem with a Monotone Anti-Monge and a Symmetric Toeplitz Matrix: Easy and Hard CasesRainer E. Burkard, Eranda Çela, Günter Rote, Gerhard J. Woeginger. 204-218
- On Optimizing Multiplications of Sparse MatricesEdith Cohen. 219-233
- Continuous Relaxations for Constrained Maximum-Entropy SamplingKurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams. 234-248
- A Submodular Optimization Problem with Side ConstraintsDavid Hartvigsen. 249-259
- Convexity and Steinitz s Exchange PropertyKazuo Murota. 260-274
- On Ideal Clutters, Metrics and MultiflowsBeth Novick, András Sebö. 275-287
- A Supermodular Relaxation for Scheduling with Release DatesMichel X. Goemans. 288-300
- Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower BoundsAndreas S. Schulz. 301-315
- Implementation of a Linear Time Algorithm for Certain Generalized Traveling Salesman ProblemsNeil Simonetti, Egon Balas. 316-329
- On Dependent Randomized Rounding AlgorithmsDimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra. 330-344
- Coloring Bipartite HypergraphsHui Chen, Alan M. Frieze. 345-358
- Improved Randomized Approximation Algorithms for Lot-Sizing ProblemsChung-Piaw Teo, Dimitris Bertsimas. 359-373
- Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special CasesHan Hoogeveen, Tsuyoshi Kawaguchi. 374-388
- A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling ProblemPaul Martin, David B. Shmoys. 389-403
- Optimal On-Line Algorithms for Single-Machine SchedulingHan Hoogeveen, Arjen P. A. Vestjens. 404-414
- The Strongest Facets of the Acyclic Subgraph Polytope Are UnknownMichel X. Goemans, Leslie A. Hall. 415-429
- Transitive PackingRudolf Müller, Andreas S. Schulz. 430-444
- A Polyhedral Approach to the Feedback Vertex Set ProblemMeinrad Funke, Gerhard Reinelt. 445-459
- Separating over Classes of TSP Inequalities Defined by 0 Node-Lifting in Polynominal TimeRobert Carr. 460-474
- Separating Maximally Violated Comb Inequalities in Planar GraphsLisa Fleischer, Éva Tardos. 475-489
- The Travelling Salesman and the PQ-TreeRainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger. 490-504