Integer ProgrammingISBN: 9780471283669
288 pages
September 1998

A practical, accessible guide to optimization problems with discrete or integer variables
Integer Programming stands out from other textbooks by explaining in clear and simple terms how to construct custommade algorithms or use existing commercial software to obtain optimal or nearoptimal solutions for a variety of realworld problems, such as airline timetables, production line schedules, or electricity production on a regional or national scale.
Incorporating recent developments that have made it possible to solve difficult optimization problems with greater accuracy, author Laurence A. Wolsey presents a number of stateoftheart topics not covered in any other textbook. These include improved modeling, cutting plane theory and algorithms, heuristic methods, and branchandcut and integer programming decomposition algorithms. This selfcontained text:
* Distinguishes between good and bad formulations in integer programming problems
* Applies lessons learned from easy integer programs to more difficult problems
* Demonstrates with applications theoretical and practical aspects of problem solving
* Includes useful notes and endofchapter exercises
* Offers tremendous flexibility for tailoring material to different needs
Integer Programming is an ideal text for courses in integer/mathematical programmingwhether in operations research, mathematics, engineering, or computer science departments. It is also a valuable reference for industrial users of integer programming and researchers who would like to keep up with advances in the field.
Integer Programming stands out from other textbooks by explaining in clear and simple terms how to construct custommade algorithms or use existing commercial software to obtain optimal or nearoptimal solutions for a variety of realworld problems, such as airline timetables, production line schedules, or electricity production on a regional or national scale.
Incorporating recent developments that have made it possible to solve difficult optimization problems with greater accuracy, author Laurence A. Wolsey presents a number of stateoftheart topics not covered in any other textbook. These include improved modeling, cutting plane theory and algorithms, heuristic methods, and branchandcut and integer programming decomposition algorithms. This selfcontained text:
* Distinguishes between good and bad formulations in integer programming problems
* Applies lessons learned from easy integer programs to more difficult problems
* Demonstrates with applications theoretical and practical aspects of problem solving
* Includes useful notes and endofchapter exercises
* Offers tremendous flexibility for tailoring material to different needs
Integer Programming is an ideal text for courses in integer/mathematical programmingwhether in operations research, mathematics, engineering, or computer science departments. It is also a valuable reference for industrial users of integer programming and researchers who would like to keep up with advances in the field.
See More
Formulations.
Optimality, Relaxation, and Bounds.
WellSolved 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.
WellSolved 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.
See More
LAURENCE A. WOLSEY is Professor of Applied Mathematics at the Center for Operations Research and Econometrics (CORE) at l'Université Catholique de Louvain at LouvainlaNeuve, Belgium. He is the author, with George Nemhauser, of Integer and Combinatorial Optimization (Wiley).
See More
Incorporating recent developments that have made it possible to solve difficult optimization problems with greater accuracy, author Laurence A. Wolsey presents a number of stateoftheart topics not covered in any other textbook. These include improved modeling, cutting plane theory and algorithms, heuristic methods, and branchandcut and integer programming decomposition algorithms. This selfcontained text:
* Distinguishes between good and bad formulations in integer programming problems
* Applies lessons learned from easy integer programs to more difficult problems
* Demonstrates with applications theoretical and practical aspects of problem solving
* Includes useful notes and endofchapter exercises
* Offers tremendous flexibility for tailoring material to different needs
* Distinguishes between good and bad formulations in integer programming problems
* Applies lessons learned from easy integer programs to more difficult problems
* Demonstrates with applications theoretical and practical aspects of problem solving
* Includes useful notes and endofchapter exercises
* Offers tremendous flexibility for tailoring material to different needs
See More
Buy Both and Save 25%!
Integer Programming (US $162.00)
and Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture (US $108.00)
Total List Price: US $270.00
Discounted Price: US $202.50 (Save: US $67.50)