國立虎尾科技大學 |

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

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Combinatorial Optimization/ edited by Ivana Ljubić, Francisco Barahona, Santanu S. Dey, A. Ridha Mahjoub.
Reminder of title:	7th International Symposium, ISCO 2022, Virtual Event, May 18–20, 2022, Revised Selected Papers /
other author:	Ljubić, Ivana.
Description:	XVII, 337 p. 43 illus., 30 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computer science—Mathematics. -
Online resource:	https://doi.org/10.1007/978-3-031-18530-4
ISBN:	9783031185304

Combinatorial Optimization = 7th International Symposium, ISCO 2022, Virtual Event, May 18–20, 2022, Revised Selected Papers /
Combinatorial Optimization7th International Symposium, ISCO 2022, Virtual Event, May 18–20, 2022, Revised Selected Papers /[electronic resource] :edited by Ivana Ljubić, Francisco Barahona, Santanu S. Dey, A. Ridha Mahjoub. - 1st ed. 2022. - XVII, 337 p. 43 illus., 30 illus. in color.online resource. - Lecture Notes in Computer Science,135261611-3349 ;. - Lecture Notes in Computer Science,9324.

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.

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.

ISBN: 9783031185304

Standard No.: 10.1007/978-3-031-18530-4doiSubjects--Topical Terms:

1253519
Computer science—Mathematics.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Combinatorial Optimization = 7th International Symposium, ISCO 2022, Virtual Event, May 18–20, 2022, Revised Selected Papers /
LDR:04095nam a22004455i 4500 001 1085710
003 DE-He213
005 20221120233201.0
007 cr nn 008mamaa
008 221228s2022 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 978-3-031-18530-4
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 1 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 p. 43 illus., 30 illus. 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. $3 1253519
650 0 $a Discrete mathematics. $3 1254302
650 0 $a Computer networks . $3 1365720
650 0 $a Algorithms. $3 527865
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Information theory. $3 595305
650 0 $a Numerical analysis. $3 527939
650 0 $a Artificial intelligence. $3 559380
650 1 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Computer Communication Networks. $3 669310
650 2 4 $a Design and Analysis of Algorithms. $3 1365721
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 2 4 $a Numerical Analysis. $3 671433
650 2 4 $a Artificial Intelligence. $3 646849
700 1 $a Ljubić, Ivana. $e editor. $1 https://orcid.org/0000-0002-4834-6284 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1392274
700 1 $a Barahona, Francisco. $e editor. $1 https://orcid.org/0000-0002-4829-7515 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1392275
700 1 $a Dey, Santanu S. $e editor. $1 https://orcid.org/0000-0003-0294-8287 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1392276
700 1 $a Mahjoub, A. Ridha. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 884056
710 2 $a SpringerLink (Online service) $3 593884
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, $x 0302-9743 ; $v 9324 $3 1258960
856 4 0 $u https://doi.org/10.1007/978-3-031-18530-4
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)