This 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.
This 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.Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Polyhedra 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.
Polyhedra 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.
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Internetauftritt der buecher.de internetstores GmbH
Geschäftsführung: Monica Sawhney | Roland Kölbl | Günter Hilger
Sitz der Gesellschaft: Batheyer Straße 115 - 117, 58099 Hagen
Postanschrift: Bürgermeister-Wegele-Str. 12, 86167 Augsburg
Amtsgericht Hagen HRB 13257
Steuernummer: 321/5800/1497
