Combinatorial Optimization
8th International Symposium, ISCO 2024, La Laguna, Tenerife, Spain, May 22¿24, 2024, Revised Selected Papers
Herausgegeben:Basu, Amitabh; Mahjoub, Ali Ridha; Salazar González, Juan José
Combinatorial Optimization
8th International Symposium, ISCO 2024, La Laguna, Tenerife, Spain, May 22¿24, 2024, Revised Selected Papers
Herausgegeben:Basu, Amitabh; Mahjoub, Ali Ridha; Salazar González, Juan José
- Broschiertes Buch
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung
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.
Andere Kunden interessierten sich auch für
- Combinatorial Optimization58,99 €
- Integer Programming and Combinatorial Optimization66,99 €
- Combinatorial Optimization41,99 €
- Integer Programming and Combinatorial Optimization50,99 €
- Integer Programming and Combinatorial Optimization62,99 €
- Combinatorial Algorithms70,99 €
- SOFSEM 2023: Theory and Practice of Computer Science58,99 €
-
-
-
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.
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.
Produktdetails
- Produktdetails
- Lecture Notes in Computer Science 14594
- Verlag: Springer / Springer Nature Switzerland / Springer, Berlin
- Artikelnr. des Verlages: 978-3-031-60923-7
- 2024
- Seitenzahl: 432
- Erscheinungstermin: 23. Mai 2024
- Englisch
- Abmessung: 235mm x 155mm x 24mm
- Gewicht: 651g
- ISBN-13: 9783031609237
- ISBN-10: 3031609239
- Artikelnr.: 70370684
- Herstellerkennzeichnung Die Herstellerinformationen sind derzeit nicht verfügbar.
- Lecture Notes in Computer Science 14594
- Verlag: Springer / Springer Nature Switzerland / Springer, Berlin
- Artikelnr. des Verlages: 978-3-031-60923-7
- 2024
- Seitenzahl: 432
- Erscheinungstermin: 23. Mai 2024
- Englisch
- Abmessung: 235mm x 155mm x 24mm
- Gewicht: 651g
- ISBN-13: 9783031609237
- ISBN-10: 3031609239
- Artikelnr.: 70370684
- Herstellerkennzeichnung Die Herstellerinformationen sind derzeit nicht verfügbar.
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.
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.