Dual-Feasible Functions for Integer Programming and Combinatorial Optimization
Basics, Extensions and Applications
-
- $39.99
-
- $39.99
Publisher Description
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.
More Books Like This
Generalized Convexity, Generalized Monotonicity and Applications
2006
Generalized Convexity and Related Topics
2006
Handbook on Semidefinite, Conic and Polynomial Optimization
2011
Linear and Integer Programming vs Linear Integration and Counting
2009
Mathematics and Methodology for Economics
2016
Variational Analysis and Set Optimization
2019