Online Public Access Catalogue (OPAC)
Library,Documentation and Information Science Division

“A research journal serves that narrow

borderland which separates the known from the unknown”

-P.C.Mahalanobis


Image from Google Jackets

Integer programming / Michelangelo Conforti, Gerard Cornuejols and Giacomo Zambelli.

By: Contributor(s): Material type: TextTextSeries: Graduate texts in mathematics ; 271.Publication details: New York : Springer, 2014.Description: xii, 456 p. ; illISBN:
  • 9783319110073 (hard cover : alk. paper)
Subject(s): DDC classification:
  • 519.77 23 C748
Contents:
1. Getting Started -- 2. Integer Programming Models -- 3. Linear Inequalities and Polyhedra -- 4. Perfect Formulations -- 5. Split and Gomory Inequalities -- 6. Intersection Cuts and Corner Polyhedra -- 7. Valid Inequalities for Structured Integer Programs -- 8. Reformulations and Relaxations -- 9. Enumeration -- 10. Semidefinite Bounds-- Bibliography-- Index.
Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.

Includes bibliographical references and index.

1. Getting Started --
2. Integer Programming Models --
3. Linear Inequalities and Polyhedra --
4. Perfect Formulations --
5. Split and Gomory Inequalities --
6. Intersection Cuts and Corner Polyhedra --
7. Valid Inequalities for Structured Integer Programs --
8. Reformulations and Relaxations --
9. Enumeration --
10. Semidefinite Bounds--
Bibliography--
Index.

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.

There are no comments on this title.

to post a comment.
Library, Documentation and Information Science Division, Indian Statistical Institute, 203 B T Road, Kolkata 700108, INDIA
Phone no. 91-33-2575 2100, Fax no. 91-33-2578 1412, ksatpathy@isical.ac.in