Relaxation and decomposition methods for mixed integer nonlinear programming /

Saved in:
Bibliographic Details
Author / Creator:Nowak, Ivo.
Imprint:Basel ; Boston : Birkhàˆuser, 2005.
Description:xvi, 213 p. : ill. ; 27 cm.
Language:English
Series:International series of numerical mathematics ; v. 152
Subject:
Format: Print Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/5714840
Hidden Bibliographic Details
ISBN:0817672389 (alk. paper)
3764372389 (alk. paper)
3764373741 (e-ISBN)
Notes:Includes bibliographical references.
Standard no.:9783764372385
Table of Contents:
  • Preface
  • I. Basic Concepts
  • 1. Introduction
  • 2. Problem Formulations
  • 3. Convex and Lagrangian Relaxations
  • 4. Decomposition Methods
  • 5. Semidefinite Relaxations
  • 6. Convex Underestimators
  • 7. Cuts, Lower Bounds and Box Reduction
  • 8. Local and Global Optimality Criteria
  • 9. Adaptive Discretization of Infinite Dimensional MINLPs
  • II. Algorithms
  • 10. Overview of Global Optimization Methods
  • 11. Deformation Heuristics
  • 12. Rounding, Partitioning and Lagrangian Heuristics
  • 13. Branch-Cut-and-Price Algorithms
  • 14. LaGO
  • Bibliography
  • Index