Integer ProgrammingISBN: 978-0-471-28366-9
Hardcover
288 pages
September 1998
This price is valid for United States. Change location to view local pricing and availability. ![]() |
Incorporating recent developments that have made it possible to solve difficult optimization problems with greater accuracy, author Laurence A. Wolsey presents a number of state-of-the-art topics not covered in any other textbook. These include improved modeling, cutting plane theory and algorithms, heuristic methods, and branch-and-cut and integer programming decomposition algorithms. This self-contained 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 end-of-chapter 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 end-of-chapter exercises
* Offers tremendous flexibility for tailoring material to different needs
Buy Both and Save 25%!
Integer Programming (US $157.00)
-and- Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture (US $104.00)
Total List Price: US $261.00
Discounted Price: US $195.75 (Save: US $65.25)

