Cantitate/Preț
Produs

Integer Programming: Graduate Texts in Mathematics, cartea 271

Autor Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
en Limba Engleză Hardback – dec 2014
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 41108 lei  38-44 zile
  Springer International Publishing – 10 sep 2016 41108 lei  38-44 zile
Hardback (1) 48865 lei  3-5 săpt.
  Springer International Publishing – dec 2014 48865 lei  3-5 săpt.

Din seria Graduate Texts in Mathematics

Preț: 48865 lei

Nou

Puncte Express: 733

Preț estimativ în valută:
9352 9714$ 7768£

Carte disponibilă

Livrare economică 11-25 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319110073
ISBN-10: 3319110071
Pagini: 456
Ilustrații: XII, 456 p. 75 illus.
Dimensiuni: 155 x 235 x 32 mm
Greutate: 0.83 kg
Ediția:2014
Editura: Springer International Publishing
Colecția Springer
Seria Graduate Texts in Mathematics

Locul publicării:Cham, Switzerland

Public țintă

Graduate

Cuprins

Preface.- 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.

Recenzii

“Integer Programming begins by introducing thesubject and giving several examples of integer programming problems. … Thisbook would be suitable for a graduate level course on the mathematics ofcutting plane methods. … This book might also be of interest as a reference forresearchers working in this area. … This book offers a more focusedpresentation that makes it better suited for use as a textbook.” (BrianBorchers, MAA Reviews, maa.org, December, 2015)
“The book is written in a very clear and didacticstyle. … very useful for mathematically mature undergraduates, graduatestudents, postdocs, and established researchers who are interested in thetechniques. …This is an excellent and impressive book. We wholeheartedlyrecommend it as a textbook for advanced undergraduate and introductory graduatecourses on integer programming.” (Jakub Marecek, Interfaces, Vol. 45 (5),September-October, 2015)
“The authors deliver a comprehensive presentation of integer programming.… Everything is presented in a rigorous way, but on the other hand, the form makes it easy to understand for everyone. Each chapter is followed by the exercises, that allow to recall the contents. … the book is an essential text in the field of integer programing, that should be recommended as a very useful textbook for students, but also a valuable introduction for the researchers in this area.” (Marcin Anholcer, zbMATH 1307.90001, 2015)

Notă biografică

Michelangelo Conforti is Professor of Mathematics at the University of Padova. Together with G. Cornuéjols and M. R. Rao, he received the 2000 Fulkerson Prize in discrete mathematics.
Gérard Cornuéjols is IBM University Professor of Operations Research at Carnegie Mellon University. His research has been recognized by numerous honors, among them the Fulkerson Prize, the Frederick W. Lanchester Prize, the Dantzig Prize, and the John von Neumann Theory Prize.
Giacomo Zambelli is Associate Professor (Reader) of Management Science at the London School of Economics and Political Sciences.
All three authors are leading experts in the fields of integer programming, graph theory, and combinatorial optimization.

Textul de pe ultima copertă

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.

Caracteristici

Gives a concise yet in-depth treatment of the theory and practice of integer programming Provides ample motivation and concrete illustration of theoretical results Guides the reader to many special topics in the literature Includes supplementary material: sn.pub/extras