Combinatorial Optimization 7th International Symposium, ISCO 2022, Virtual Event, May 18–20, 2022, Revised Selected Papers /

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 w...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Ljubic, Ivana (Editor), Barahona, Francisco (Editor), Dey, Santanu S. (Editor), Mahjoub, A. Ridha (Editor)
Format: Electronic eBook
Language:English
Published: Cham : Springer International Publishing : Imprint: Springer, 2022.
Edition:1st ed. 2022.
Series:Lecture notes in computer science ; 13526.
Subjects:
Online Access: Full text (Wentworth users only)

MARC

LEADER 00000cam a22000005i 4500
001 w2942426
005 20231013093804.0
007 cr nn 008mamaa
008 221120s2022 sz | s |||| 0|eng d
020 |a 9783031185304  |9 978-3-031-18530-4 
024 7 |a 10.1007/978-3-031-18530-4  |2 doi 
035 |a (DE-He213)978-3-031-18530-4 
040 |d UtOrBLW 
049 |a WENN 
050 4 |a QA76.9.M35 
050 4 |a QA297.4 
072 7 |a UYAM  |2 bicssc 
072 7 |a PBD  |2 bicssc 
072 7 |a COM018000  |2 bisacsh 
072 7 |a UYAM  |2 thema 
072 7 |a PBD  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 0 0 |a Combinatorial Optimization  |h [electronic resource] :  |b 7th International Symposium, ISCO 2022, Virtual Event, May 18–20, 2022, Revised Selected Papers /  |c edited by Ivana Ljubić, Francisco Barahona, Santanu S. Dey, A. Ridha Mahjoub. 
250 |a 1st ed. 2022. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2022. 
300 |a XVII, 337 pages 43 illustrations, 30 illustrations in color :  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 1611-3349 ;  |v 13526 
505 0 |a 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. 
520 |a 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. 
650 0 |a Computer science—Mathematics. 
650 0 |a Discrete mathematics.  |0 sh2019000551 
650 0 |a Computer networks.  |0 sh 85029513  
650 0 |a Algorithms.  |0 sh 85003487  
650 0 |a Data structures (Computer science)  |0 sh 85035862  
650 0 |a Information theory.  |0 sh 85066289  
650 0 |a Numerical analysis.  |0 sh 85093237  
650 0 |a Artificial intelligence.  |0 sh 85008180  
700 1 |a Ljubic, Ivana,  |e editor.  |1 https://orcid.org/0000-0002-4834-6284  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt  |0 no2019085004 
700 1 |a Barahona, Francisco,  |e editor.  |0 (orcid)0000-0002-4829-7515  |1 https://orcid.org/0000-0002-4829-7515  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Dey, Santanu S.,  |e editor.  |0 (orcid)0000-0003-0294-8287  |1 https://orcid.org/0000-0003-0294-8287  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Mahjoub, A. Ridha,  |e editor.  |0 (orcid)0000-0002-1079-1892  |1 https://orcid.org/0000-0002-1079-1892  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service)  |0 no2005046756 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783031185298 
776 0 8 |i Printed edition:  |z 9783031185311 
830 0 |a Lecture notes in computer science ;  |v 13526.  |0 n 42015162  
951 |a 2942426 
999 f f |i 5e9a7362-76ce-5d09-b2c4-e3f7ae70719a  |s bdac6412-40b2-597a-90ea-f5223e336986  |t 0 
952 f f |a Wentworth Institute of Technology  |b Main Campus  |c Wentworth Library  |d Ebooks  |t 0  |e Springer  |h Other scheme 
856 4 0 |t 0  |u https://ezproxywit.flo.org/login?qurl=https://doi.org/10.1007/978-3-031-18530-4  |y Full text (Wentworth users only)