![]() Integer Programming
ISBN: 978-0-471-28366-9
Hardcover
288 pages
September 1998
US $122.95
This price is valid for United States. Change location to view local pricing and availability. |
Instructors may request an evaluation copy for this title.
|
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.
References.
Index.
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.
References.
Index.


