×

zbMATH — the first resource for mathematics

Integer programming. 2nd edition. (English) Zbl 07267975
Hoboken, NJ: John Wiley & Sons (ISBN 978-1-119-60653-6/hbk; 978-1-119-60647-5/ebook). xix, 316 p. (2021).
Preliminary review / Publisher’s description: The revised second edition of Integer Programming explains in clear and simple terms how to construct custom-made algorithms or use existing commercial software to obtain optimal or near-optimal solutions for a variety of real-world problems. The second edition also includes information on the remarkable progress in the development of mixed integer programming solvers in the 22 years since the first edition of the book appeared. The updated text includes information on the most recent developments in the field such as the much improved preprocessing/presolving and the many new ideas for primal heuristics included in the solvers. The result has been a speed-up of several orders of magnitude. The other major change reflected in the text is the widespread use of decomposition algorithms, in particular column generation (branch-(cut)-and-price) and Benders’ decomposition. The revised second edition:
Contains new developments on column generation
Offers a new chapter on Benders’ algorithm
Includes expanded information on preprocessing, heuristics, and branch-and-cut
Presents several basic and extended formulations, for example for fixed cost network flows
Also touches on and briefly introduces topics such as non-bipartite matching, the complexity of extended formulations or a good linear program for the implementation of lift-and-project

Written for students of integer/mathematical programming in operations research, mathematics, engineering, or computer science, Integer Programming offers an updated edition of the basic text that reflects the most recent developments in the field.
See the review of the first edition in [Zbl 0930.90072].
MSC:
90C10 Integer programming
90-01 Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming
90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C11 Mixed integer programming
PDF BibTeX XML Cite
Full Text: DOI