000 03682nam a22005655i 4500
001 978-3-7643-7374-0
003 DE-He213
005 20161121230530.0
007 cr nn 008mamaa
008 100301s2005 sz | s |||| 0|eng d
020 _a9783764373740
_9978-3-7643-7374-0
024 7 _a10.1007/3-7643-7374-1
_2doi
050 4 _aQA76.9.M35
072 7 _aUYAM
_2bicssc
072 7 _aUFM
_2bicssc
072 7 _aCOM018000
_2bisacsh
072 7 _aMAT003000
_2bisacsh
082 0 4 _a004.0151
_223
100 1 _aNowak, Ivo.
_eauthor.
245 1 0 _aRelaxation and Decomposition Methods for Mixed Integer Nonlinear Programming
_h[electronic resource] /
_cby Ivo Nowak.
264 1 _aBasel :
_bBirkhäuser Basel,
_c2005.
300 _aXVI, 213 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aInternational Series of Numerical Mathematics ;
_v152
505 0 _aBasic 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.
520 _aThis 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 in MINLP. The presented material consists of two parts. The first part describes basic optimization tools, such as block-separable reformulations, convex and Lagrangian relaxations, decomposition methods and global optimality criteria. Some of these results are presented here for the first time. The second part is devoted to algorithms. Starting with a short overview on existing methods, deformation, rounding, partitioning and Lagrangian heuristics, and a branch-cut-and-price algorithm are presented. The algorithms are implemented as part of an object-oriented library, called LaGO. Numerical results on several mixed integer nonlinear programs are reported to show abilities and limits of the proposed solution methods. The book contains many illustrations and an up-to-date bibliography. Because of the emphasis on practical methods, as well as the introduction into the basic theory, it is accessible to a wide audience and can be used both as a research as well as a graduate text.
650 0 _aComputer science.
650 0 _aComputer programming.
650 0 _aComputer science
_xMathematics.
650 0 _aApplied mathematics.
650 0 _aEngineering mathematics.
650 0 _aAlgorithms.
650 0 _aComputer mathematics.
650 1 4 _aComputer Science.
650 2 4 _aMath Applications in Computer Science.
650 2 4 _aApplications of Mathematics.
650 2 4 _aAlgorithms.
650 2 4 _aComputational Science and Engineering.
650 2 4 _aProgramming Techniques.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783764372385
830 0 _aInternational Series of Numerical Mathematics ;
_v152
856 4 0 _uhttp://dx.doi.org/10.1007/3-7643-7374-1
912 _aZDB-2-SCS
950 _aComputer Science (Springer-11645)
999 _c500176
_d500176