000 05832nam a22006375i 4500
001 978-3-540-68891-4
003 DE-He213
005 20240730173829.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540688914
_9978-3-540-68891-4
024 7 _a10.1007/978-3-540-68891-4
_2doi
050 4 _aQA76.9.M35
050 4 _aQA297.4
072 7 _aUYAM
_2bicssc
072 7 _aPBD
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYAM
_2thema
072 7 _aPBD
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aInteger Programming and Combinatorial Optimization
_h[electronic resource] :
_b13th International Conference, IPCO 2008 Bertinoro, Italy, May 26-28, 2008 Proceedings /
_cedited by Andrea Lodi, Alessandro Panconesi, Giovanni Rinaldi.
250 _a1st ed. 2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2008.
300 _aXI, 477 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5035
505 0 _aSession 1 -- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables -- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs -- The Air Traffic Flow Management Problem: An Integer Optimization Approach -- Session 2 -- The Induced Disjoint Paths Problem -- A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs -- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs -- A Polynomial Algorithm for Weighted Abstract Flow -- Session 3 -- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem -- Binary Positive Semidefinite Matrices and Associated Integer Polytopes -- Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities -- Session 4 -- Tight Bounds for Permutation Flow Shop Scheduling -- The Stochastic Machine Replenishment Problem -- A Polynomial Time Approximation Scheme for the Square Packing Problem -- Session 5 -- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints -- Computing with Multi-row Gomory Cuts -- Constraint Orbital Branching -- Session 6 -- A Fast, Simpler Algorithm for the Matroid Parity Problem -- Degree Bounded Matroids and Submodular Flows -- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle -- Session 7 -- Primal-Dual Schema for Capacitated Covering Problems -- Offline and Online Facility Leasing -- Importance Sampling via Load-Balanced Facility Location -- Session 8 -- A Constant Approximation Algorithm for the a priori Traveling Salesman Problem -- New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem -- Min Sum Edge Coloring in Multigraphs Via Configuration LP -- Session 9 -- An Improved Algorithm for Finding Cycles Through Elements -- The Stable Roommates Problem with Choice Functions -- A New Approach to Splitting-Off -- Session 10 -- Can Pure Cutting Plane Algorithms Work? -- The Mixing Set with Divisible Capacities -- A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging -- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles.
520 _aThe volume contains the papers selected for presentation at IPCO 2008, the 13th International Conference on Integer Programming and Combinatorial - timization that was held in Bertinoro (Italy), May 26-28, 2008. The IPCO series of conferences, sponsored by the Mathematical Progr- ming Society, highlights recent developments in theory, computation, and app- cation of integer programming and combinatorial optimization. The ?rst conf- ence took place in 1990; starting from IPCO 1995, the proceedings are published in the Lecture Notes in Computer Science series. The 12 previous IPCO conferences were held in Waterloo (Canada) 1990, Pittsburgh (USA) 1992, Erice (Italy) 1993, Copenhagen (Denmark) 1995 [LNCS 920], Vancouver (Canada) 1996 [LNCS 1084], Houston (USA) 1998 [LNCS 1412], Graz (Austria) 1999 [LNCS 1610], Utrecht (The Netherlands) 2001 [LNCS 2081], Boston (USA) 2002 [LNCS 2337], New York (USA) 2004 [LNCS 2986], Berlin (Germany) 2005 [LNCS 3509], and Ithaca (USA) 2007 [LNCS 4168]. The c- ference is not held in the years when the International Symposium of the Ma- ematical Programming Society takes place.
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aNumerical analysis.
_94603
650 0 _aAlgorithms.
_93390
650 0 _aComputer graphics.
_94088
650 1 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aNumerical Analysis.
_94603
650 2 4 _aAlgorithms.
_93390
650 2 4 _aComputer Graphics.
_94088
700 1 _aLodi, Andrea.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9109934
700 1 _aPanconesi, Alessandro.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9109935
700 1 _aRinaldi, Giovanni.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9109936
710 2 _aSpringerLink (Online service)
_9109937
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540688860
776 0 8 _iPrinted edition:
_z9783540848202
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5035
_9109938
856 4 0 _uhttps://doi.org/10.1007/978-3-540-68891-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c89120
_d89120