000 04437nam a22005775i 4500
001 978-3-642-32147-4
003 DE-He213
005 20140220083323.0
007 cr nn 008mamaa
008 120705s2012 gw | s |||| 0|eng d
020 _a9783642321474
_9978-3-642-32147-4
024 7 _a10.1007/978-3-642-32147-4
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
100 1 _aMahjoub, A. Ridha.
_eeditor.
245 1 0 _aCombinatorial Optimization
_h[electronic resource] :
_bSecond International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers /
_cedited by A. Ridha Mahjoub, Vangelis Markakis, Ioannis Milis, Vangelis Th. Paschos.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2012.
300 _aXIV, 476 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,
_x0302-9743 ;
_v7422
505 0 _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.
520 _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.
650 0 _aComputer science.
650 0 _aComputer Communication Networks.
650 0 _aComputer software.
650 0 _aElectronic data processing.
650 0 _aComputational complexity.
650 0 _aAlgorithms.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aNumeric Computing.
650 2 4 _aAlgorithms.
650 2 4 _aComputer Communication Networks.
700 1 _aMarkakis, Vangelis.
_eeditor.
700 1 _aMilis, Ioannis.
_eeditor.
700 1 _aPaschos, Vangelis Th.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642321467
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7422
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-32147-4
912 _aZDB-2-SCS
912 _aZDB-2-LNC
999 _c103457
_d103457