000 05097nam a22006015i 4500
001 978-3-030-45771-6
003 DE-He213
005 20240730173915.0
007 cr nn 008mamaa
008 200413s2020 sz | s |||| 0|eng d
020 _a9783030457716
_9978-3-030-45771-6
024 7 _a10.1007/978-3-030-45771-6
_2doi
050 4 _aQA76.9.M35
072 7 _aUYAM
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYAM
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aInteger Programming and Combinatorial Optimization
_h[electronic resource] :
_b21st International Conference, IPCO 2020, London, UK, June 8-10, 2020, Proceedings /
_cedited by Daniel Bienstock, Giacomo Zambelli.
250 _a1st ed. 2020.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2020.
300 _aIX, 450 p. 409 illus., 29 illus. in color.
_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 ;
_v12125
505 0 _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 therank 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.
520 _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.
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aData structures (Computer science).
_98188
650 0 _aInformation theory.
_914256
650 0 _aComputer engineering.
_910164
650 0 _aComputer networks .
_931572
650 0 _aDatabase management.
_93157
650 1 4 _aMathematics of Computing.
_931875
650 2 4 _aData Structures and Information Theory.
_931923
650 2 4 _aComputer Engineering and Networks.
_9110269
650 2 4 _aDatabase Management System.
_932540
700 1 _aBienstock, Daniel.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9110270
700 1 _aZambelli, Giacomo.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9110271
710 2 _aSpringerLink (Online service)
_9110272
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030457709
776 0 8 _iPrinted edition:
_z9783030457723
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12125
_9110273
856 4 0 _uhttps://doi.org/10.1007/978-3-030-45771-6
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c89161
_d89161