000 03456nam a22006495i 4500
001 978-3-540-36478-8
003 DE-He213
005 20240423132439.0
007 cr nn 008mamaa
008 121227s2003 gw | s |||| 0|eng d
020 _a9783540364788
_9978-3-540-36478-8
024 7 _a10.1007/3-540-36478-1
_2doi
050 4 _aQA273.A1-274.9
072 7 _aPBT
_2bicssc
072 7 _aPBWL
_2bicssc
072 7 _aMAT029000
_2bisacsh
072 7 _aPBT
_2thema
072 7 _aPBWL
_2thema
082 0 4 _a519.2
_223
245 1 0 _aCombinatorial Optimization -- Eureka, You Shrink!
_h[electronic resource] :
_bPapers Dedicated to Jack Edmonds. 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers /
_cedited by Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi.
250 _a1st ed. 2003.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2003.
300 _aX, 214 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2570
505 0 _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.
650 0 _aProbabilities.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aAlgorithms.
650 0 _aNumerical analysis.
650 0 _aComputer graphics.
650 1 4 _aProbability Theory.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aAlgorithms.
650 2 4 _aNumerical Analysis.
650 2 4 _aComputer Graphics.
700 1 _aJünger, Michael.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aReinelt, Gerhard.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aRinaldi, Giovanni.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540005803
776 0 8 _iPrinted edition:
_z9783662196991
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2570
856 4 0 _uhttps://doi.org/10.1007/3-540-36478-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c187848
_d187848