國立高雄大學圖資館 |

Language: English

Back

Combinatorial optimization8th International Symposium, ISCO 2024, La Laguna, Tenerife, Spain, May 22-24, 2024 : revised selected papers /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Combinatorial optimizationedited by Amitabh Basu, Ali Ridha Mahjoub, Juan José Salazar González.
Reminder of title:	8th International Symposium, ISCO 2024, La Laguna, Tenerife, Spain, May 22-24, 2024 : revised selected papers /
remainder title:	ISCO 2024
other author:	Basu, Amitabh.
corporate name:
Published:	Cham :Springer Nature Switzerland :2024.
Description:	xiii, 418 p. :ill. (chiefly col.), digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Combinatorial optimizationCongresses.
Online resource:	https://doi.org/10.1007/978-3-031-60924-4
ISBN:	9783031609244$q(electronic bk.)

Combinatorial optimization8th International Symposium, ISCO 2024, La Laguna, Tenerife, Spain, May 22-24, 2024 : revised selected papers /
Combinatorial optimization8th International Symposium, ISCO 2024, La Laguna, Tenerife, Spain, May 22-24, 2024 : revised selected papers /[electronic resource] :ISCO 2024edited by Amitabh Basu, Ali Ridha Mahjoub, Juan José Salazar González. - Cham :Springer Nature Switzerland :2024. - xiii, 418 p. :ill. (chiefly col.), digital ;24 cm. - Lecture notes in computer science,145941611-3349 ;. - Lecture notes in computer science ;4891..

Integer Programming -- On disjunction convex hulls by lifting -- On a geometric graph-covering problem related to optimal safety-landing site location -- Quadratically Constrained Reformulation, Strong Semidefinite Programming Bounds, and Algorithms for the Chordless Cycle Problem -- A Family of Spanning-Tree Formulations for the Maximum Cut Problem -- Optimal cycle selections: An experimental assessment of integer programming formulations -- 1-Persistency of the clique relaxation of the stable set polytope -- Alternating direction method and deep learning for discrete control with storage -- Branch and Cut for Partitioning a Graph into a Cycle of Clusters -- Graph Theory -- Computing the Edge Expansion of a Graph using Semidefinite Programming -- Minimizing External Vertices in Hypergraph Orientations -- Open-separating dominating codes in graphs -- On the complexity of the minimum chromatic violation problem -- Crystal Trees -- Parameterized Algorithms -- Reducing Treewidth for SAT-related Problems using Simple Liftings -- Total Matching and Subdeterminants -- A new structural parameter on single machine scheduling with release dates and deadlines -- Fixed-Parameter Algorithms for Cardinality-Constrained Graph Partitioning Problems on Sparse Graphs -- Approximation Algorithms -- Sequencing Stochastic Jobs with a Single Sample -- The Thief Orienteering Problem on Series-Parallel Graphs -- Approximation Algorithm for Job Scheduling with Reconfigurable Resources -- Network Design on Undirected Series-Parallel Graphs -- Online Graph Coloring with Predictions -- Integer Programming for Machine Learning -- Neuron pairs in binarized neural networks robustness verification via integer linear programming -- Optimal counterfactual explanations for k-Nearest Neighbors using Mathematical Optimization and Constraint Programming -- Applications -- Surrogate Constraints for Synchronized Energy Production/Consumption -- A Robust Two-stage Model For the Urban Air Mobility Flight Scheduling Problem -- Optimal charging station location in a linear cycle path with deviations -- An efficient timing algorithm for drivers with rest periods -- Fair Energy Allocation for Collective Self-Consumption -- Day-ahead lot-sizing under uncertainty: An application to green hydrogen production.

This book constitutes the refereed proceedings of the 8th International Symposium on Combinatorial Optimization, ISCO 2024, held in La Laguna, Tenerife, Spain, during May 22-24, 2024. The 30 full papers included in this book were carefully reviewed and selected from 46 submissions. They were organized in topical sections as follows: integer programming; graph theory; parameterized algorithms; approximation algorithms; integer programming for machine learning; and applications.

ISBN: 9783031609244$q(electronic bk.)

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

441127
Combinatorial optimization
--Congresses.

LC Class. No.: QA402.5

Dewey Class. No.: 519.64

Combinatorial optimization8th International Symposium, ISCO 2024, La Laguna, Tenerife, Spain, May 22-24, 2024 : revised selected papers /
LDR:04055nmm a2200373 a 4500 001 659003
003 DE-He213
005 20240522130129.0
006 m d
007 cr nn 008maaau
008 240927s2024 sz s 0 eng d
020 $a 9783031609244$q(electronic bk.)
020 $a 9783031609237$q(paper)
024 7 $a 10.1007/978-3-031-60924-4 $2 doi
035 $a 978-3-031-60924-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA402.5
072 7 $a UYAM $2 bicssc
072 7 $a PBD $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYAM $2 thema
072 7 $a PBD $2 thema
082 0 4 $a 519.64 $2 23
090 $a QA402.5 $b .I77 2024
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Combinatorial optimization $h [electronic resource] : $b 8th International Symposium, ISCO 2024, La Laguna, Tenerife, Spain, May 22-24, 2024 : revised selected papers / $c edited by Amitabh Basu, Ali Ridha Mahjoub, Juan José Salazar González.
246 3 $a ISCO 2024
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2024.
300 $a xiii, 418 p. : $b ill. (chiefly col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 1611-3349 ; $v 14594
505 0 $a Integer Programming -- On disjunction convex hulls by lifting -- On a geometric graph-covering problem related to optimal safety-landing site location -- Quadratically Constrained Reformulation, Strong Semidefinite Programming Bounds, and Algorithms for the Chordless Cycle Problem -- A Family of Spanning-Tree Formulations for the Maximum Cut Problem -- Optimal cycle selections: An experimental assessment of integer programming formulations -- 1-Persistency of the clique relaxation of the stable set polytope -- Alternating direction method and deep learning for discrete control with storage -- Branch and Cut for Partitioning a Graph into a Cycle of Clusters -- Graph Theory -- Computing the Edge Expansion of a Graph using Semidefinite Programming -- Minimizing External Vertices in Hypergraph Orientations -- Open-separating dominating codes in graphs -- On the complexity of the minimum chromatic violation problem -- Crystal Trees -- Parameterized Algorithms -- Reducing Treewidth for SAT-related Problems using Simple Liftings -- Total Matching and Subdeterminants -- A new structural parameter on single machine scheduling with release dates and deadlines -- Fixed-Parameter Algorithms for Cardinality-Constrained Graph Partitioning Problems on Sparse Graphs -- Approximation Algorithms -- Sequencing Stochastic Jobs with a Single Sample -- The Thief Orienteering Problem on Series-Parallel Graphs -- Approximation Algorithm for Job Scheduling with Reconfigurable Resources -- Network Design on Undirected Series-Parallel Graphs -- Online Graph Coloring with Predictions -- Integer Programming for Machine Learning -- Neuron pairs in binarized neural networks robustness verification via integer linear programming -- Optimal counterfactual explanations for k-Nearest Neighbors using Mathematical Optimization and Constraint Programming -- Applications -- Surrogate Constraints for Synchronized Energy Production/Consumption -- A Robust Two-stage Model For the Urban Air Mobility Flight Scheduling Problem -- Optimal charging station location in a linear cycle path with deviations -- An efficient timing algorithm for drivers with rest periods -- Fair Energy Allocation for Collective Self-Consumption -- Day-ahead lot-sizing under uncertainty: An application to green hydrogen production.
520 $a This book constitutes the refereed proceedings of the 8th International Symposium on Combinatorial Optimization, ISCO 2024, held in La Laguna, Tenerife, Spain, during May 22-24, 2024. The 30 full papers included in this book were carefully reviewed and selected from 46 submissions. They were organized in topical sections as follows: integer programming; graph theory; parameterized algorithms; approximation algorithms; integer programming for machine learning; and applications.
650 0 $a Combinatorial optimization $v Congresses. $3 441127
650 1 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Computer Communication Networks. $3 218087
650 2 4 $a Design and Analysis of Algorithms. $3 913142
650 2 4 $a Data Structures and Information Theory. $3 825714
650 2 4 $a Numerical Analysis. $3 275681
650 2 4 $a Artificial Intelligence. $3 212515
700 1 $a Basu, Amitabh. $3 970358
700 1 $a Mahjoub, Ali Ridha. $3 970359
700 1 $a Salazar González, Juan José. $3 970360
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u https://doi.org/10.1007/978-3-031-60924-4
950 $a Computer Science (SpringerNature-11645)