LEADER 03850nam  22007455  450 
001 9910299992803321
005 20200706094005.0
010   $a3-319-11008-X
024 7 $a10.1007/978-3-319-11008-0
035   $a(CKB)3710000000306121
035   $a(SSID)ssj0001386552
035   $a(PQKBManifestationID)11814659
035   $a(PQKBTitleCode)TC0001386552
035   $a(PQKBWorkID)11374016
035   $a(PQKB)10161451
035   $a(DE-He213)978-3-319-11008-0
035   $a(MiAaPQ)EBC6312977
035   $a(MiAaPQ)EBC5595660
035   $a(Au-PeEL)EBL5595660
035   $a(OCoLC)899249111
035   $a(PPN)18309607X
035   $a(EXLCZ)993710000000306121
100   $a20141115d2014      u|         0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aInteger Programming /$fby Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
205   $a1st ed. 2014.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2014.
215   $a1 online resource (XII, 456 p. 75 illus.)
225 1 $aGraduate Texts in Mathematics,$x0072-5285 ;$v271
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-319-11007-1 
327   $aPreface -- 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.
330   $aThis 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.
410  0$aGraduate Texts in Mathematics,$x0072-5285 ;$v271
606   $aOperations research
606   $aManagement science
606   $aConvex geometry 
606   $aDiscrete geometry
606   $aAlgorithms
606   $aOperations Research, Management Science$3https://scigraph.springernature.com/ontologies/product-market-codes/M26024
606   $aConvex and Discrete Geometry$3https://scigraph.springernature.com/ontologies/product-market-codes/M21014
606   $aAlgorithms$3https://scigraph.springernature.com/ontologies/product-market-codes/M14018
615  0$aOperations research.
615  0$aManagement science.
615  0$aConvex geometry .
615  0$aDiscrete geometry.
615  0$aAlgorithms.
615 14$aOperations Research, Management Science.
615 24$aConvex and Discrete Geometry.
615 24$aAlgorithms.
676   $a519.77
700   $aConforti$b Michele$4aut$4http://id.loc.gov/vocabulary/relators/aut$0447987
702   $aCornuéjols$b Gérard$4aut$4http://id.loc.gov/vocabulary/relators/aut
702   $aZambelli$b Giacomo$4aut$4http://id.loc.gov/vocabulary/relators/aut
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910299992803321
996   $aInteger Programming$92527085
997   $aUNINA