Dual-feasible Functions for Integer Programming and Combinatorial Optimization: Basics, Extensions and Applications

Renting vs. Buying This Textbook

Renting is usually cheapest if you only need the book for one term: you return it with a free prepaid label when the term ends. Buying used can beat renting when the sell-back price is high, so compare the sell-back price with the rental price before you decide. An eTextbook arrives instantly but usually expires. Rentals and used copies rarely include working access codes.

Always match the ISBN on your syllabus (9783319276021) before you order; different editions have different ISBNs.

About This Book

This book provides a postgraduate audience the keys they need to understand and further develop a set of tools for the efficient computation of lower bounds and valid inequalities in integer programs and combinatorial optimization problems. After discussing the classical approaches described in the literature, the book addresses how to extend these tools to other non-standard formulations that may be applied to a broad set of applications. Examples are provided to illustrate the underlying concepts and to pave the way for future contributions.