LEADER 06346nam 22009255 450 001 9910768194503321 005 20251226200415.0 010 $a1-280-94938-4 010 $a9786610949380 010 $a3-540-72792-2 024 7 $a10.1007/978-3-540-72792-7 035 $a(CKB)1000000000478516 035 $a(EBL)3061539 035 $a(SSID)ssj0000180207 035 $a(PQKBManifestationID)11154664 035 $a(PQKBTitleCode)TC0000180207 035 $a(PQKBWorkID)10148810 035 $a(PQKB)10626809 035 $a(DE-He213)978-3-540-72792-7 035 $a(MiAaPQ)EBC3061539 035 $a(MiAaPQ)EBC6706932 035 $a(Au-PeEL)EBL6706932 035 $a(PPN)12316267X 035 $a(BIP)46136485 035 $a(BIP)14225825 035 $a(EXLCZ)991000000000478516 100 $a20100301d2007 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aInteger Programming and Combinatorial Optimization $e12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings /$fedited by Matteo Fischetti, David P. Williamson 205 $a1st ed. 2007. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007. 215 $a1 online resource (508 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4513 300 $aDescription based upon print version of record. 311 08$a3-540-72791-4 320 $aIncludes bibliographical references and index. 327 $aSession 1 -- Inequalities from Two Rows of a Simplex Tableau -- Cuts for Conic Mixed-Integer Programming -- Sequential-Merge Facets for Two-Dimensional Group Problems -- Session 2 -- Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract) -- The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization -- Finding a Polytope from Its Graph in Polynomial Time -- Session 3 -- Orbitopal Fixing -- New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing -- Orbital Branching -- Session 4 -- Distinct Triangle Areas in a Planar Point Set -- Scheduling with Precedence Constraints of Low Fractional Dimension -- Approximation Algorithms for 2-Stage Stochastic Scheduling Problems -- Session 5 -- On Integer Programming and the Branch-Width of the Constraint Matrix -- Matching Problems in Polymatroids Without Double Circuits -- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) -- Session 6 -- On a Generalization of the Master Cyclic Group Polyhedron -- A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications -- On the Exact Separation of Mixed Integer Knapsack Cuts -- Session 7 -- A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization -- On Convex Minimization over Base Polytopes -- Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems -- Session 8 -- Generating Multiple Solutions for Mixed Integer Programming Problems -- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations -- DINS, a MIP Improvement Heuristic -- Session 9 -- Mixed-Integer Vertex Covers on Bipartite Graphs -- On the MIR Closure of Polyhedra -- The Intersection of ContinuousMixing Polyhedra and the Continuous Mixing Polyhedron with Flows -- Session 10 -- Simple Explicit Formula for Counting Lattice Points of Polyhedra -- Characterizations of Total Dual Integrality -- Sign-Solvable Linear Complementarity Problems -- Session 11 -- An Integer Programming Approach for Linear Programs with Probabilistic Constraints -- Infrastructure Leasing Problems -- Robust Combinatorial Optimization with Exponential Scenarios -- Session 12 -- Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities -- Optimal Efficiency Guarantees for Network Design Mechanisms -- The Set Connector Problem in Graphs. 330 $aThis book constitutes the refereed proceedings of the 12th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2007, held in Ithaca, NY, USA, in June 2007. The 36 revised full papers presented were carefully reviewed and selected from over 120 submissions. Among the topics addressed are approximation algorithms, algorithmic game theory, branch and bound algorithms, branch and cut algorithms, computational biology, computational complexity, computational geometry, cutting plane algorithms, diophantine equations, geometry of numbers, graph and network algorithms, integer programming, matroids and submodular functions, on-line algorithms and competitive analysis, polyhedral combinatorics, randomized algorithms, random graphs, scheduling theory and scheduling algorithms, as well as semidefinite programs. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4513 606 $aComputer science 606 $aSoftware engineering 606 $aProbabilities 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aAlgorithms 606 $aTheory of Computation 606 $aSoftware Engineering 606 $aProbability Theory 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aAlgorithms 615 0$aComputer science. 615 0$aSoftware engineering. 615 0$aProbabilities. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aAlgorithms. 615 14$aTheory of Computation. 615 24$aSoftware Engineering. 615 24$aProbability Theory. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 615 24$aAlgorithms. 676 $a519.77 702 $aFischetti$b Matteo 702 $aWilliamson$b David P. 712 12$aConference on Integer Programming and Combinatorial Optimization 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910768194503321 996 $aInteger Programming and Combinatorial Optimization$92860150 997 $aUNINA