Dual-Feasible Functions for Integer Programming and Combinatorial Optimization: Basics, Extensions and Applications
✍ Scribed by Cláudio Alves, Francois Clautiaux, José Valério de Carvalho, Jürgen Rietz (auth.)
- Publisher
- Springer International Publishing
- Year
- 2016
- Tongue
- English
- Leaves
- 166
- Series
- EURO Advanced Tutorials on Operational Research
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
✦ Synopsis
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.
✦ Table of Contents
Front Matter....Pages i-xi
Linear and Integer Programming....Pages 1-19
Classical Dual-Feasible Functions....Pages 21-49
General Dual-Feasible Functions....Pages 51-89
Applications for Cutting and Packing Problems....Pages 91-123
Other Applications in General Integer Programming....Pages 125-131
Back Matter....Pages 133-159
✦ Subjects
Operation Research/Decision Theory; Operations Research, Management Science; Discrete Optimization
📜 SIMILAR VOLUMES
<p><p></p><p>Dynamic programming is an efficient technique for solving optimization problems. It is based on breaking the initial problem down into simpler ones and solving these sub-problems, beginning with the simplest ones. A conventional dynamic programming algorithm returns an optimal object fr
Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION<br><br>"This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 7