LEADER 05097nam 22006495 450 001 9910864195903321 005 20251225193622.0 010 $a3-031-59835-0 024 7 $a10.1007/978-3-031-59835-7 035 $a(MiAaPQ)EBC31351911 035 $a(Au-PeEL)EBL31351911 035 $a(CKB)32140303000041 035 $a(DE-He213)978-3-031-59835-7 035 $a(MiAaPQ)EBC31574323 035 $a(Au-PeEL)EBL31574323 035 $a(EXLCZ)9932140303000041 100 $a20240521d2024 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aInteger Programming and Combinatorial Optimization $e25th International Conference, IPCO 2024, Wroclaw, Poland, July 3?5, 2024, Proceedings /$fedited by Jens Vygen, Jaros?aw Byrka 205 $a1st ed. 2024. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2024. 215 $a1 online resource (474 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v14679 311 08$a3-031-59834-2 327 $aSparsity and integrality gap transference bounds for integer programs -- Separating k-Median from the Supplier Version -- A Better-Than-1.6-Approximation for Prize-Collecting TSP -- On Matrices over a Polynomial Ring with Restricted Subdeterminants -- A First Order Method for Linear Programming Parameterized by Circuit Imbalance -- Approximately Packing Dijoins via Nowhere-Zero Flows -- Capacitated Facility Location with Outliers and Uniform Facility Costs -- Integer Points in Arbitrary Convex Cones: The Case of the PSD and SOC Cones -- The Extension Complexity of Polytopes with Bounded Integral Slack Matrices -- Assortment Optimization with Visibility Constraints -- Adaptivity Gaps in Two-sided Assortment Optimization -- Two-Stage Stochastic Stable Matching -- Von Neumann-Morgenstern Stability and Internal Closedness in Matching Theory -- Fully-Dynamic Load Balancing -- Pairwise-Independent Contention Resolution -- An FPTAS for Connectivity Interdiction -- Tight Lower Bounds for Block-Structured Integer Programs -- A Lower Bound for the Max Entropy Algorithm for TSP -- On the Number of Degenerate Simplex Pivots -- On the Partial Convexification of the Low-Rank Spectral Optimization: Rank Bounds and Algorithms -- On the Congruency-Constrained Matroid Base -- Online Combinatorial Assignment in Independence Systems -- Decomposing Probability Marginals Beyond Affine Requirements -- Polynomial Algorithms to Minimize 2/3-Submodular Functions -- A 4/3-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs -- Extending the primal-dual 2-approximation algorithm beyond uncrossable set families -- Network Flow Problems with Electric Vehicles -- Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack -- Relaxation strength for multilinear optimization: McCormick strikes back -- Online Algorithms for Spectral Hypergraph Sparsification -- Fast Combinatorial Algorithms for Efficient Sortation -- A New Branching Rule for Range Minimization Problems -- Sensitivity analysis for mixed binary quadratic programming. 330 $aThis book constitutes the refereed proceedings of the 25th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2024, held in Wroc?aw, Poland, during July 3?5, 2024. The 33 full papers presented were carefully reviewed and selected from 101 submissions. IPCO is under the auspices of the Mathematical Optimization Society, and it is an important forum for presenting present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems. . 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v14679 606 $aComputer science$xMathematics 606 $aMathematics$xData processing 606 $aDiscrete mathematics 606 $aApplication software 606 $aMathematics of Computing 606 $aComputational Mathematics and Numerical Analysis 606 $aDiscrete Mathematics in Computer Science 606 $aComputer and Information Systems Applications 615 0$aComputer science$xMathematics. 615 0$aMathematics$xData processing. 615 0$aDiscrete mathematics. 615 0$aApplication software. 615 14$aMathematics of Computing. 615 24$aComputational Mathematics and Numerical Analysis. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer and Information Systems Applications. 676 $a40,151 700 $aVygen$b Jens$0441957 701 $aByrka$b Jaros?aw$01740254 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910864195903321 996 $aInteger Programming and Combinatorial Optimization$94165676 997 $aUNINA