LEADER 05341nam 22008175 450 001 9910631085503321 005 20251113181950.0 010 $a9783031185304 010 $a3031185307 024 7 $a10.1007/978-3-031-18530-4 035 $a(MiAaPQ)EBC7143809 035 $a(Au-PeEL)EBL7143809 035 $a(CKB)25430587200041 035 $a(PPN)266348262 035 $a(OCoLC)1352866036 035 $a(DE-He213)978-3-031-18530-4 035 $a(EXLCZ)9925430587200041 100 $a20221120d2022 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aCombinatorial Optimization $e7th International Symposium, ISCO 2022, Virtual Event, May 18?20, 2022, Revised Selected Papers /$fedited by Ivana Ljubi?, Francisco Barahona, Santanu S. Dey, A. Ridha Mahjoub 205 $a1st ed. 2022. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2022. 215 $a1 online resource (340 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v13526 311 08$aPrint version: Ljubi?, Ivana Combinatorial Optimization Cham : Springer International Publishing AG,c2022 9783031185298 320 $aIncludes bibliographical references and index. 327 $aPolyhedra and Algorithms -- New classes of facets for complementarity knapsack problems -- Branch-and-Cut for a 2-Commodity Flow Relocation Model with Time Constraints -- The Constrained-Routing and Spectrum Assignment Problem: Valid Inequalities and Branch-and-Cut Algorithm -- Polyhedra and Combinatorics -- Top-$k$ List Aggregation: Mathematical Formulations and Polyhedral Comparisons -- Bounded variation in binary sequences -- On Minimally Non-Firm Binary Matrices -- Few Induced Disjoint Paths for H-Free Graphs -- On Permuting some Coordinates of Polytopes -- Non-linear Optimization -- Piecewise linearization of bivariate nonlinear functions: minimizing the number of pieces under a bounded approximation error -- An outer-approximation algorithm for maximum-entropy sampling -- Mitigating Anomalies in Parallel Branch-and-Bound Based Algorithms for Mixed-Integer Nonlinear Optimization -- Game Theory -- Exact Price of Anarchy for Weighted Congestion Games with Two Players.-Nash balanced assignment problem -- Graphs and Trees -- On the thinness of trees -- Generating Spanning Tree Sequences of a Fan Graph in Lexicographic Order and Ranking/Unranking Algorithms -- Cutting and Packing -- High Multiplicity Strip Packing with Three Rectangle Types -- Improved Bounds for Stochastic Extensible Bin Packing under Distributional Assumptions -- Applications -- One transfer per patient suffices: Structural insights about patient-to-room assignment -- Tool switching problems in the context of overlay printing with multiple colours -- Optimal Vaccination Strategies for Multiple Dose Vaccinations -- Approximation Algorithms -- Pervasive Domination -- Unified Greedy Approximability Beyond Submodular Maximization -- Neighborhood persistency of the linear optimization relaxation of integer linear optimization -- Polynomial-Time Approximation Schemes for a Class of Integrated Network Design and Scheduling Problems with Parallel Identical Machines. 330 $aThis book constitutes thoroughly refereed and revised selected papers from the 7th International Symposium on Combinatorial Optimization, ISCO 2022, which was held online during May 18?20, 2022. The 24 full papers included in this book were carefully reviewed and selected from 50 submissions. They were organized in topical sections as follows: Polyhedra and algorithms; polyhedra and combinatorics; non-linear optimization; game theory; graphs and trees; cutting and packing; applications; and approximation algorithms. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v13526 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aComputer networks 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aInformation theory 606 $aNumerical analysis 606 $aArtificial intelligence 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Communication Networks 606 $aDesign and Analysis of Algorithms 606 $aData Structures and Information Theory 606 $aNumerical Analysis 606 $aArtificial Intelligence 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aComputer networks. 615 0$aAlgorithms. 615 0$aData structures (Computer science) 615 0$aInformation theory. 615 0$aNumerical analysis. 615 0$aArtificial intelligence. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aComputer Communication Networks. 615 24$aDesign and Analysis of Algorithms. 615 24$aData Structures and Information Theory. 615 24$aNumerical Analysis. 615 24$aArtificial Intelligence. 676 $a519.64 676 $a519.64 702 $aLjubic$b Ivana 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910631085503321 996 $aCombinatorial optimization$9262324 997 $aUNINA