Integer Programming
Conforti, Michele
Integer Programming Michele Conforti, Geard Cornuejols, Giacomo Zambelli - Cham, Heidelberg: Springer, c2014 - xii, 456 p. : ill. - Graduate Texts in Mathematics, 271. 0072-5285 ; . - Springer ebooks collection. Graduate texts in mathematics ; .
Bibliografie p. 415
Index p. 447
Getting Started -- Integer Programming Models -- Linear Inequalities and Polyhedra -- Perfect Formulations -- Split and Gomory Inequalities -- Intersection Cuts and Corner Polyhedra -- Valid Inequalities for Structured Integer Programs -- Reformulations and Relaxations -- Enumeration -- Semidefinite Bounds.
This book is an elegant and rigorous presentation of integer programming, exposing the subject?s mathematical depth and broad applicability. Special attention is given to the theory behind the algorithms used in state-of-the-art solvers. An abundance of concrete examples and exercises of both theoretical and real-world interest explore the wide range of applications and ramifications of the theory. Each chapter is accompanied by an expertly informed guide to the literature and special topics, rounding out the reader?s understanding and serving as a gateway to deeper study. Key topics include: formulations polyhedral theory cutting planes decomposition enumeration semidefinite relaxations Written by renowned experts in integer programming and combinatorial optimization, Integer Programming is destined to become an essential text in the field.
eng
978-3-319-11007-3
Integer programming.
Algorithms.
Discrete groups.
T57.74 QA402-402.37 T57.6-57.97
519.77
Integer Programming Michele Conforti, Geard Cornuejols, Giacomo Zambelli - Cham, Heidelberg: Springer, c2014 - xii, 456 p. : ill. - Graduate Texts in Mathematics, 271. 0072-5285 ; . - Springer ebooks collection. Graduate texts in mathematics ; .
Bibliografie p. 415
Index p. 447
Getting Started -- Integer Programming Models -- Linear Inequalities and Polyhedra -- Perfect Formulations -- Split and Gomory Inequalities -- Intersection Cuts and Corner Polyhedra -- Valid Inequalities for Structured Integer Programs -- Reformulations and Relaxations -- Enumeration -- Semidefinite Bounds.
This book is an elegant and rigorous presentation of integer programming, exposing the subject?s mathematical depth and broad applicability. Special attention is given to the theory behind the algorithms used in state-of-the-art solvers. An abundance of concrete examples and exercises of both theoretical and real-world interest explore the wide range of applications and ramifications of the theory. Each chapter is accompanied by an expertly informed guide to the literature and special topics, rounding out the reader?s understanding and serving as a gateway to deeper study. Key topics include: formulations polyhedral theory cutting planes decomposition enumeration semidefinite relaxations Written by renowned experts in integer programming and combinatorial optimization, Integer Programming is destined to become an essential text in the field.
eng
978-3-319-11007-3
Integer programming.
Algorithms.
Discrete groups.
T57.74 QA402-402.37 T57.6-57.97
519.77