000 | 05360nam a22007095i 4500 | ||
---|---|---|---|
001 | 978-3-031-18530-4 | ||
003 | DE-He213 | ||
005 | 20240730174314.0 | ||
007 | cr nn 008mamaa | ||
008 | 221120s2022 sz | s |||| 0|eng d | ||
020 |
_a9783031185304 _9978-3-031-18530-4 |
||
024 | 7 |
_a10.1007/978-3-031-18530-4 _2doi |
|
050 | 4 | _aQA76.9.M35 | |
050 | 4 | _aQA297.4 | |
072 | 7 |
_aUYAM _2bicssc |
|
072 | 7 |
_aPBD _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYAM _2thema |
|
072 | 7 |
_aPBD _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aCombinatorial Optimization _h[electronic resource] : _b7th International Symposium, ISCO 2022, Virtual Event, May 18-20, 2022, Revised Selected Papers / _cedited by Ivana Ljubić, Francisco Barahona, Santanu S. Dey, A. Ridha Mahjoub. |
250 | _a1st ed. 2022. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2022. |
|
300 |
_aXVII, 337 p. 43 illus., 30 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 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v13526 |
|
505 | 0 | _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. | |
520 | _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. | ||
650 | 0 |
_aComputer science _xMathematics. _93866 |
|
650 | 0 |
_aDiscrete mathematics. _912873 |
|
650 | 0 |
_aComputer networks . _931572 |
|
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 0 |
_aData structures (Computer science). _98188 |
|
650 | 0 |
_aInformation theory. _914256 |
|
650 | 0 |
_aNumerical analysis. _94603 |
|
650 | 0 |
_aArtificial intelligence. _93407 |
|
650 | 1 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
650 | 2 | 4 |
_aComputer Communication Networks. _9111940 |
650 | 2 | 4 |
_aDesign and Analysis of Algorithms. _931835 |
650 | 2 | 4 |
_aData Structures and Information Theory. _931923 |
650 | 2 | 4 |
_aNumerical Analysis. _94603 |
650 | 2 | 4 |
_aArtificial Intelligence. _93407 |
700 | 1 |
_aLjubić, Ivana. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9111941 |
|
700 | 1 |
_aBarahona, Francisco. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9111942 |
|
700 | 1 |
_aDey, Santanu S. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9111943 |
|
700 | 1 |
_aMahjoub, A. Ridha. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9111944 |
|
710 | 2 |
_aSpringerLink (Online service) _9111945 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783031185298 |
776 | 0 | 8 |
_iPrinted edition: _z9783031185311 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v13526 _923263 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-031-18530-4 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c89362 _d89362 |