1. A computational comparison of algorithms for the inventory routing problem

   • M. Dror
   • M. Ball
   • B. Golden

   Combinatorial Optimization Pages: 1 - 23

2. Sensitivity analysis for the matching problem and its use in solving matching problems with a single side constraint

   • M. O. Ball
   • R. Taverna

   Combinatorial Optimization Pages: 25 - 56

3. The shortest augmenting path method for solving assignment problems — Motivation and computational experience

   • U. Derigs

   Combinatorial Optimization Pages: 57 - 102

4. An optimal minimax algorithm

   • E. N. Gilbert

   Combinatorial Optimization Pages: 103 - 121

5. K best solutions to combinatorial optimization problems

   • H. W. Hamacher
   • M. Queyranne

   Combinatorial Optimization Pages: 123 - 143

6. Lp-based combinatorial problem solving

   • K. Hoffman
   • M. Padberg

   Combinatorial Optimization Pages: 145 - 194

7. Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and Boolean functions

   • R. H. Möhring

   Combinatorial Optimization Pages: 195 - 225

8. Scheduling of project networks

   • F. J. Radermacher

   Combinatorial Optimization Pages: 227 - 252

9. An efficient alorithm for the general multiple-choice knapsack problem (GMKP)

   • K. Mathur
   • H. M. Salkin
   • S. Morito

   Combinatorial Optimization Pages: 253 - 283

10. Local search in routing problems with time windows

    • M. W. P. Savelsbergh

    Combinatorial Optimization Pages: 285 - 305

11. A method for maximizing the reliability coefficient of a communications network

    • S. Singhal
    • G. L. Thompson

    Combinatorial Optimization Pages: 307 - 326

12. A problem expanding parametric programming method for solving the job shop scheduling problem

    • G. L. Thompson
    • D. J. Zawack

    Combinatorial Optimization Pages: 327 - 342

13. One-parametric bottleneck transportation problems

    • I. S. Schubert
    • U. Zimmermann

    Combinatorial Optimization Pages: 343 - 369