A computational comparison of algorithms for the inventory routing problem M. DrorM. BallB. Golden Combinatorial Optimization Pages: 1 - 23
Sensitivity analysis for the matching problem and its use in solving matching problems with a single side constraint M. O. BallR. Taverna Combinatorial Optimization Pages: 25 - 56
The shortest augmenting path method for solving assignment problems — Motivation and computational experience U. Derigs Combinatorial Optimization Pages: 57 - 102
K best solutions to combinatorial optimization problems H. W. HamacherM. Queyranne Combinatorial Optimization Pages: 123 - 143
Lp-based combinatorial problem solving K. HoffmanM. Padberg Combinatorial Optimization Pages: 145 - 194
Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and Boolean functions R. H. Möhring Combinatorial Optimization Pages: 195 - 225
An efficient alorithm for the general multiple-choice knapsack problem (GMKP) K. MathurH. M. SalkinS. Morito Combinatorial Optimization Pages: 253 - 283
Local search in routing problems with time windows M. W. P. Savelsbergh Combinatorial Optimization Pages: 285 - 305
A method for maximizing the reliability coefficient of a communications network S. SinghalG. L. Thompson Combinatorial Optimization Pages: 307 - 326
A problem expanding parametric programming method for solving the job shop scheduling problem G. L. ThompsonD. J. Zawack Combinatorial Optimization Pages: 327 - 342
One-parametric bottleneck transportation problems I. S. SchubertU. Zimmermann Combinatorial Optimization Pages: 343 - 369
