Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming
This book presents a comprehensive description of theory, algorithms and software for solving nonconvex mixed integer nonlinear programs (MINLP). The main focus is on deterministic global optimization methods, which play a very important role in integer linear programming, and are used only recently...
Κύριος συγγραφέας: | |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Basel :
Birkhäuser Basel,
2005.
|
Σειρά: | International Series of Numerical Mathematics ;
152 |
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- Basic Concepts
- Problem Formulations
- Convex and Lagrangian Relaxations
- Decomposition Methods
- Semidefinite Relaxations
- Convex Underestimators
- Cuts, Lower Bounds and Box Reduction
- Local and Global Optimality Criteria
- Adaptive Discretization of Infinite Dimensional MINLPs
- Algorithms
- Overview of Global Optimization Methods
- Deformation Heuristics
- Rounding, Partitioning and Lagrangian Heuristics
- Branch-Cut-and-Price Algorithms
- LaGO — An Object-Oriented Library for Solving MINLPs.