Integer programming and combinatorial optimization : 21st International Conference, IPCO 2020, London, UK, June 8-10, 2020, Proceedings /: 21st International Conference, IPCO 2020, London, UK, June 8-10, 2020, Proceedings. (2020)

• Record Type: Book
• Other Titles: IPCO 2020
• Further Information: Note: Daniel Bienstock, Giacomo Zambelli (eds.).
• Editors: Bienstock, Daniel; Zambelli, Giacomo
• Other Names: Conference on Integer Programming and Combinatorial Optimization, 21st
• Contents: Idealness 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 Diagr ams -- On convex hulls of epigraphs of QCQPs -- On the convexi cation of constrained quadratic optimization problems with indicator variables.
• Publisher Details: Cham, Switzerland : Springer
• Publication Date: 2020
• Copyright Date: 2020
• Extent: 1 online resource (x, 450 pages), illustrations
• Subjects: 519.7/7; Integer programming -- Congresses; Combinatorial optimization -- Congresses
• Languages: English
• ISBNs: 9783030457716; 3030457710
• Related ISBNs: 9783030457709
• Notes: Note: Includes bibliographical references and author index.; Note: Description based on online resource (SpringerLink, viewed June 17, 2020).
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.