LEADER 05196nam 22006975 450 001 9910409672103321 005 20230329190255.0 010 $a3-030-45771-0 024 7 $a10.1007/978-3-030-45771-6 035 $a(CKB)4100000011223255 035 $a(MiAaPQ)EBC6202719 035 $a(DE-He213)978-3-030-45771-6 035 $a(PPN)243761139 035 $a(EXLCZ)994100000011223255 100 $a20200413d2020 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aInteger Programming and Combinatorial Optimization $e21st International Conference, IPCO 2020, London, UK, June 8?10, 2020, Proceedings /$fedited by Daniel Bienstock, Giacomo Zambelli 205 $a1st ed. 2020. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2020. 215 $a1 online resource (x, 450 pages) $cillustrations 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12125 311 $a3-030-45770-2 320 $aIncludes bibliographical references and index. 327 $aIdealness of k-wise intersecting families -- Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity -- Faster Algorithms for Parametric Global Minimum Cut Problems -- Optimizing Sparsity over Lattices and Semigroups -- A Technique for Obtaining True Approximations for k-Center with Covering Constraints -- Tight Approximation Bounds for Maximum Multi-Coverage -- Implementing automatic Benders decomposition in a modern MIP solver -- Improved Approximation Algorithms for Inventory Problems -- Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles -- On a generalization of the Chv atal-Gomory closure -- Algorithms for ows over time with scheduling costs -- Integer Plane Multi ow Maximisation: Flow-Cut Gap and One-Quarter-Approximation -- Stochastic Makespan Minimization in Structured Set Systems -- Continuous facility location on graphs -- Recognizing even-cycle and even-cut matroids -- A combinatorial algorithm for computing the rank of a generic partitioned matrix with $2 ntimes 2$ submatrices -- Fair Colorful k-Center Clustering -- Popular Branchings and Their Dual Certi cates -- Sparse graphs and an augmentation problem -- About the Complexity of Two-Stage Stochastic Ips -- Packing under Convex Quadratic Constraints -- Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles -- Single source unsplittable ows with arc-wise lower and upper bounds -- Maximal quadratic-free sets -- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming -- Andrea Lodi and Felipe Serrano -- The integrality number of an integer program -- Persistency of Linear Programming Relaxations for the Stable Set Problem -- Constructing lattice-free gradient polyhedra in dimension two -- Sequence independent lifting for the set of submodular maximization problem -- A Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle Covering -- Graph Coloring Lower Bounds from Decision Diagrams -- On convex hulls of epigraphs of QCQPs -- On the convexi cation of constrained quadratic optimization problems with indicator variables. 330 $aThis book constitutes the refereed proceedings of the 21st International Conference on Integer Programming and Combinatorial Optimization, IPCO 2020, held in London, UK, in June 2020. The 33 full versions of extended abstracts presented were carefully reviewed and selected from 126 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12125 606 $aComputer science?Mathematics 606 $aData structures (Computer science) 606 $aInformation theory 606 $aComputer engineering 606 $aComputer networks 606 $aDatabase management 606 $aMathematics of Computing 606 $aData Structures and Information Theory 606 $aComputer Engineering and Networks 606 $aDatabase Management System 615 0$aComputer science?Mathematics. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 0$aComputer engineering. 615 0$aComputer networks. 615 0$aDatabase management. 615 14$aMathematics of Computing. 615 24$aData Structures and Information Theory. 615 24$aComputer Engineering and Networks. 615 24$aDatabase Management System. 676 $a519.77 676 $a519.77 702 $aBienstock$b Daniel$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aZambelli$b Giacomo$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910409672103321 996 $aInteger Programming and Combinatorial Optimization$92860150 997 $aUNINA