Relaxation and decomposition methods for mixed integer nonlinear programming / Ivo Nowak.
This book presents a comprehensive description of efficient methods for solving nonconvex mixed integer nonlinear programs, including several numerical and theoretical results, which are presented here for the first time. It contains many illustrations and an up-to-date bibliography. Because on the...
Saved in:
| Online Access: |
Full Text (via Springer) |
|---|---|
| Main Author: | |
| Format: | eBook |
| Language: | English |
| Published: |
Basel ; Boston, MA :
Birkhäuser,
©2005.
|
| Series: | International series of numerical mathematics ;
v. 152. |
| Subjects: |
Table of Contents:
- Introduction; 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; 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.