LEADER 05175nam 22007215 450 001 9910337840003321 005 20230329233001.0 010 $a3-030-17953-2 024 7 $a10.1007/978-3-030-17953-3 035 $a(CKB)4100000008103802 035 $a(DE-He213)978-3-030-17953-3 035 $a(MiAaPQ)EBC5922806 035 $a(PPN)236521934 035 $a(EXLCZ)994100000008103802 100 $a20190417d2019 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aInteger Programming and Combinatorial Optimization $e20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings /$fedited by Andrea Lodi, Viswanath Nagarajan 205 $a1st ed. 2019. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2019. 215 $a1 online resource (XI, 454 p. 313 illus., 20 illus. in color.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11480 300 $aIncludes index. 311 $a3-030-17952-4 327 $aIdentically Self-Blocking Clutters -- Min-Max Correlation Clustering via -- Strong Mixed-Integer Programming Formulations for Trained Neural -- Extended Formulations from Communication Protocols in Output-Efficient -- Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry -- Intersection Cuts for Polynomial Optimization -- Fixed-Order Scheduling on Parallel Machines -- Online Submodular Maximization: Beating 1/2 Made Simple -- Improving the Integrality Gap for Multiway Cut -- nell 1-sparsity Approximation Bounds for Packing Integer Programs -- A General Framework for Handling Commitment in Online Throughput Maximization -- Lower Bounds and A New Exact Approach for the Bilevel Knapsack with Interdiction Constraints -- On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule -- Tight Approximation Ratio for Minimum Maximal Matching -- Integer Programming and Incidence Treedepth -- A Bundle Approach for SDPs with Exact Subgraph Constraints -- Dynamic Flows with Adaptive Route Choice -- The Markovian Price of Information -- On Perturbation Spaces of Minimal Valid Functions: Inverse Semigroup Theory and Equivariant Decomposition Theorem -- On Compact Representations of Voronoi Cells of Lattices -- An Efficient Characterization of Submodular Spanning Tree Games -- The Asymmetric Traveling Salesman Path LP Has Constant Integrality Ratio -- Approximate Multi-Matroid Intersection via Iterative Refinement -- An Exact Algorithm for Robust Influence Maximization -- A New Contraction Technique with Applications to Congruency-Constrained Cuts -- Sparsity of Integer Solutions in the Average Case -- A Generic Exact Solver for Vehicle Routing and Related Problems -- Earliest Arrival Transshipments in Networks With Multiple Sinks -- Intersection Cuts for Factorable MINLP -- Linear Programming Using Limited-Precision Oracles -- Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time -- Breaking Symmetries to Rescue SoS: The Case of Makespan Scheduling -- Random Projections for Quadratic Programs over a Euclidean Ball. 330 $aThis book constitutes the refereed proceedings of the 20th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2019, held in Ann Arbor, MI, USA, in May 2019. The 33 full versions of extended abstracts presented were carefully reviewed and selected from 114 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 ;$v11480 606 $aNumerical analysis 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aArtificial intelligence?Data processing 606 $aComputer arithmetic and logic units 606 $aNumerical Analysis 606 $aDiscrete Mathematics in Computer Science 606 $aAlgorithms 606 $aData Science 606 $aArithmetic and Logic Structures 615 0$aNumerical analysis. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aArtificial intelligence?Data processing. 615 0$aComputer arithmetic and logic units. 615 14$aNumerical Analysis. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aAlgorithms. 615 24$aData Science. 615 24$aArithmetic and Logic Structures. 676 $a519.77 676 $a519.77 702 $aLodi$b Andrea$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aNagarajan$b Viswanath$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910337840003321 996 $aInteger Programming and Combinatorial Optimization$92860150 997 $aUNINA