Dual-Feasible Functions for Integer Programming and Combinatorial Optimization

Basics, Extensions and Applications

Textbook © 2016

 

Springer Link

Alves, C., Clautiaux, F., de Carvalho, J.V., Rietz, J.


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.

Keywords: Dantzig-Wolfe decomposition, combinatorial optimization, cutting and packing problem, integer programming, production planning, routing and location application, scheduling



Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 3.0 International License and the GNU Free Documentation License (unversioned, with no invariant sections, front-cover texts, or back-cover texts).

Privacy Policy.

EURO-Online login

 

 

EJOR EJCO
EJDP EJTL