LEADER 04284nam  22007815  450 
001 9910145911503321
005 20200706014556.0
010   $a3-540-36478-1
024 7 $a10.1007/3-540-36478-1
035   $a(CKB)1000000000016796
035   $a(SSID)ssj0000321912
035   $a(PQKBManifestationID)11257602
035   $a(PQKBTitleCode)TC0000321912
035   $a(PQKBWorkID)10280808
035   $a(PQKB)11516353
035   $a(DE-He213)978-3-540-36478-8
035   $a(MiAaPQ)EBC3071855
035   $a(PPN)155165348
035   $a(EXLCZ)991000000000016796
100   $a20121227d2003      u|         0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aCombinatorial Optimization -- Eureka, You Shrink! $ePapers Dedicated to Jack Edmonds. 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers /$fedited by Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi
205   $a1st ed. 2003.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003.
215   $a1 online resource (X, 214 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2570
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-00580-3 
320   $aIncludes bibliographical references and index.
327   $a?Eureka ? You Skrink!? -- ?Eureka ? You Shrink!? -- Submodular Functions, Matroids, and Certain Polyhedra -- Matching: A Well-Solved Class of Integer Linear Programs -- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems -- Connected Matchings -- Hajós? Construction and Polytopes -- Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection -- Solving Real-World ATSP Instances by Branch-and-Cut -- The Bundle Method for Hard Combinatorial Optimization Problems -- The One-Commodity Pickup-and-Delivery Travelling Salesman Problem -- Reconstructing a Simple Polytope from Its Graph -- An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming -- A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope -- Constructing New Facets of the Consecutive Ones Polytope -- A Simplex-Based Algorithm for 0-1 Mixed Integer Programming -- Mixed-Integer Value Functions in Stochastic Programming -- Exact Algorithms for NP-Hard Problems: A Survey.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v2570
606   $aProbabilities
606   $aComputer science?Mathematics
606   $aAlgorithms
606   $aNumerical analysis
606   $aComputer graphics
606   $aProbability Theory and Stochastic Processes$3https://scigraph.springernature.com/ontologies/product-market-codes/M27004
606   $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028
606   $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021
606   $aNumeric Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I1701X
606   $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013
606   $aAlgorithms$3https://scigraph.springernature.com/ontologies/product-market-codes/M14018
615  0$aProbabilities.
615  0$aComputer science?Mathematics.
615  0$aAlgorithms.
615  0$aNumerical analysis.
615  0$aComputer graphics.
615 14$aProbability Theory and Stochastic Processes.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aAlgorithm Analysis and Problem Complexity.
615 24$aNumeric Computing.
615 24$aComputer Graphics.
615 24$aAlgorithms.
676   $a519.3
702   $aJünger$b Michael$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aReinelt$b Gerhard$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aRinaldi$b Giovanni$4edt$4http://id.loc.gov/vocabulary/relators/edt
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910145911503321
996   $aCombinatorial optimization-Eureka, you shrink$9954145
997   $aUNINA