A practical, accessible guide to optimization problems with discrete or integer variables [http://mathdl.ir]
428 51 21MB
English Pages 265 [286] Year 1998
Table of contents :
Formulations.
Optimality, Relaxation, and Bounds.
Well-Solved Problems.
Matchings and Assignments.
Dynamic Programming.
Complexity and Problem Reductions.
Branch and Bound.
Cutting Plane Algorithms.
Strong Valid Inequalities.
Lagrangian Duality.
Column Generation Algorithms.
Heuristic Algorithms.
From Theory to Solutions.