LEADER 05054nam 22007335 450 001 996465281103316 005 20230220162222.0 010 $a3-642-32147-X 024 7 $a10.1007/978-3-642-32147-4 035 $a(CKB)3400000000085721 035 $a(SSID)ssj0000745865 035 $a(PQKBManifestationID)11470305 035 $a(PQKBTitleCode)TC0000745865 035 $a(PQKBWorkID)10860022 035 $a(PQKB)11719949 035 $a(DE-He213)978-3-642-32147-4 035 $a(MiAaPQ)EBC3069914 035 $a(PPN)168321084 035 $a(EXLCZ)993400000000085721 100 $a20120705d2012 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial Optimization$b[electronic resource] $eSecond International Symposium, ISCO 2012, Athens, Greece, 19-21, Revised Selected Papers /$fedited by A. Ridha Mahjoub, Vangelis Markakis, Ioannis Milis, Vangelis Th. Paschos 205 $a1st ed. 2012. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2012. 215 $a1 online resource (XIV, 476 p. 63 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7422 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-32146-1 320 $aIncludes bibliographical references and author index. 327 $aStructure Theorems for Optimum Hyperpaths in Directed Hypergraphs -- Branch-and-Price Guided -- The New Faces of Combinatorial Optimization -- Models and Algorithms for the Train Unit Assignment Problem -- The Minimum Stabbing Triangulation Problem: IP Models and Computational Evaluation -- Using Symmetry to Optimize over the Sherali-Adams Relaxation -- A Second-Order Cone Programming Approximation to Joint Chance-Constrained Linear Programs -- Semidefinite Relaxations for Mixed 0-1 Second-Order Cone Program -- The Non-Disjoint m-Ring-Star Problem : Polyhedral Results and SDH/SONET Network Design.-The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks -- Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem -- Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols -- An Algebraic Approach to Symmetric Extended Formulations -- Dual Consistent Systems of Linear Inequalities and Cardinality Constrained Polytopes -- Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone.-The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks -- Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem -- Extended Formulations, Nonnegative Factorizations, and Randomized Communication -- An Algebraic Approach to Symmetric Extended.-On the Hop Constrained Steiner Tree Problem with Multiple Root.-Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs -- A Second-Order Cone Programming Approximation to Joint Chance-Constrained Linear Programs.-Extended Formulations, Nonnegative Factorizations, and Randomized Communication -- An Algebraic Approach to Symmetric Extended.-Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm. 330 $aThis book constitutes the thoroughly refereed post-conference proceedings of the Second International Symposium on Combinatorial Optimization, ISCO 2012, held in Athens, Greece, in April 2012. The 37 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 94 regular and 30 short submissions. They present original research on all aspects of combinatorial optimization, ranging from mathematical foundations and theory of algorithms to computational studies and practical applications. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7422 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aComputer networks 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aComputer Communication Networks 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aComputer networks. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 615 24$aComputer Communication Networks. 676 $a005.1 702 $aMahjoub$b A. Ridha$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMarkakis$b Vangelis$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMilis$b Ioannis$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPaschos$b Vangelis Th$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aISCO (Symposium : Combinatorial optimization) 906 $aBOOK 912 $a996465281103316 996 $aCombinatorial optimization$9262324 997 $aUNISA