Buch, Englisch, Band 14594, 418 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 651 g
8th International Symposium, ISCO 2024, La Laguna, Tenerife, Spain, May 22¿24, 2024, Revised Selected Papers
Buch, Englisch, Band 14594, 418 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 651 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-031-60923-7
Verlag: Springer Nature Switzerland
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.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz
- Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
- Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
- Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Numerische Mathematik
- Mathematik | Informatik EDV | Informatik Technische Informatik Netzwerk-Hardware
- Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Informationstheorie, Kodierungstheorie
Weitere Infos & Material
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.
