Funded by the European Union. Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Education and Culture Executive Agency (EACEA). Neither the European Union nor EACEA can be held responsible for them.


Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming

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. In this book relaxation and decomposition methods for solving nonconvex structured MINLPs are proposed. In particular, a generic branch-cut-and-price (BCP) framework for MINLP is presented. BCP is the underlying concept in almost all modern MIP solvers. Providing a powerful decomposition framework for both sequential and parallel solvers, it made the success of the current MIP technology possible.
Because on the emphasis on practical methods, as well as the introduction into the basic theory, the book is accessible to a wide audience. It can be used both as a research and as a graduate text.



Target Group:

Cite as:
I. Nowak, Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming, Basel, International Series of Numerical Mathematics, Vol. 152, XVI, 213 p., 2005

Author of the review:
Ivo Nowak
HAW Hamburg


You have to login to leave a comment. If you are not registered click here