LEADER 07052nam 22008415 450 001 996466233803316 005 20200629184551.0 010 $a3-540-25960-0 024 7 $a10.1007/b97946 035 $a(CKB)1000000000212393 035 $a(DE-He213)978-3-540-25960-2 035 $a(SSID)ssj0000180206 035 $a(PQKBManifestationID)11183133 035 $a(PQKBTitleCode)TC0000180206 035 $a(PQKBWorkID)10148690 035 $a(PQKB)10353645 035 $a(MiAaPQ)EBC3088306 035 $a(PPN)155167359 035 $a(EXLCZ)991000000000212393 100 $a20121227d2004 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aInteger Programming and Combinatorial Optimization$b[electronic resource] $e10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings /$fedited by George Nemhauser, Daniel Bienstock 205 $a1st ed. 2004. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2004. 215 $a1 online resource (XII, 448 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v3064 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-22113-1 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aSession 1 -- Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem -- Metric Inequalities and the Network Loading Problem -- Valid Inequalities Based on Simple Mixed-Integer Sets -- Session 2 -- The Price of Anarchy when Costs Are Non-separable and Asymmetric -- Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem -- Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games -- Session 3 -- A Robust Optimization Approach to Supply Chain Management -- Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems -- Scheduling an Industrial Production Facility -- Session 4 -- Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs -- A TDI Description of Restricted 2-Matching Polytopes -- Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems -- Session 5 -- Semi-continuous Cuts for Mixed-Integer Programming -- Combinatorial Benders? Cuts -- A Faster Exact Separation Algorithm for Blossom Inequalities -- Session 6 -- LP-based Approximation Algorithms for Capacitated Facility Location -- A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem -- Separable Concave Optimization Approximately Equals Piecewise Linear Optimization -- Session 7 -- Three Kinds of Integer Programming Algorithms Based on Barvinok?s Rational Functions -- The Path-Packing Structure of Graphs -- More on a Binary-Encoded Coloring Formulation -- Session 8 -- Single Machine Scheduling with Precedence Constraints -- The Constrained Minimum Weighted Sum of Job Completion Times Problem -- Session 9 -- Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption -- A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts -- All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables -- Session 10 -- A Capacity Scaling Algorithm for M-convex Submodular Flow -- Integer Concave Cocirculations and Honeycombs -- Minsquare Factors and Maxfix Covers of Graphs -- Session 11 -- Low-Dimensional Faces of Random 0/1-Polytopes -- On Polyhedra Related to Even Factors -- Optimizing over Semimetric Polytopes. 330 $aThis volume contains the papers accepted for publication at IPCO X, the Tenth International Conference on Integer Programming and Combinatorial Optimization, held in New York City, New York, USA, June 7?11, 2004.The IPCO series of conferences presents recent results in theory, computation and applications of integer programming and combinatorial optimization. These conferences are sponsored by the Mathematical Programming Society, and are held in those years in which no International Symposium on Mathematical Programming takes place. IPCO VIII was held in Utrecht (The Netherlands) and IPCO IX was held in Cambridge (USA). A total of 109 abstracts, mostly of very high quality, were submitted. The Program Committee accepted 32, in order to meet the goal of having three days of talks with no parallel sessions. Thus, many excellent abstracts could not be accepted. The papers in this volume have not been refereed. It is expected that revised versions of the accepted papers will be submitted to standard scientific journals for publication. The Program Committee thanks all authors of submitted manuscripts for their support of IPCO. March 2004 George Nemhauser Daniel Bienstock Organization IPCO X was hosted by the Computational Optimization Research Center (CORC), Columbia University. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v3064 606 $aProbabilities 606 $aApplied mathematics 606 $aEngineering mathematics 606 $aComputers 606 $aNumerical analysis 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aProbability Theory and Stochastic Processes$3https://scigraph.springernature.com/ontologies/product-market-codes/M27004 606 $aApplications of Mathematics$3https://scigraph.springernature.com/ontologies/product-market-codes/M13003 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aNumeric Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I1701X 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 615 0$aProbabilities. 615 0$aApplied mathematics. 615 0$aEngineering mathematics. 615 0$aComputers. 615 0$aNumerical analysis. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 14$aProbability Theory and Stochastic Processes. 615 24$aApplications of Mathematics. 615 24$aTheory of Computation. 615 24$aNumeric Computing. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aDiscrete Mathematics in Computer Science. 676 $a519.7/7 702 $aNemhauser$b George$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aBienstock$b Daniel$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aConference on Integer Programming and Combinatorial Optimization 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466233803316 996 $aInteger Programming and Combinatorial Optimization$9772247 997 $aUNISA