Buch, Englisch, 576 Seiten, Format (B × H): 155 mm x 235 mm
9th International Symposium, ISCO 2026, Kusadasi, Türkiye, May 4–8, 2026, Proceedings
Buch, Englisch, 576 Seiten, Format (B × H): 155 mm x 235 mm
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-032-34518-9
Verlag: Springer
This book constitutes the refereed proceedings of the 9th International Symposium on Combinatorial Optimization, ISCO 2026, held in Kusadasi, Türkiye, during May 4–8, 2026.
The 41 full papers were included in this were carefully reviewed and selected from 64 submissions. The papers cover the following topical sections: Scheduling; Mathematical Programming; Combinatorial Optimization; Polyhedral Combinatorics; Complexity; Approximation Algorithms; Network Design; Stochastic Optimization; Graphs and Combinatorics, and Applications.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
- Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
- Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik
- Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Informationstheorie, Kodierungstheorie
- Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz
- Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Numerische Mathematik
- Mathematik | Informatik EDV | Informatik Technische Informatik Netzwerk-Hardware
Weitere Infos & Material
.- Scheduling.
.- Parallel Machine Job Scheduling under Tree-Delay Precedence Constraints.
.- Job Scheduling under No-Idleness Constraints.
.- Minimizing the Total Weighted Completion Time using Restarts.
.- Efficient and fair single-machine scheduling.
.- Counterfactual Recourse Explanation for Sustainable Job-Shop.
.- Mathematical Programming.
.- Reformulations and Heuristics for the Shortest Positive Path Problem in Signed Digraphs.
.- Branch and Price for Job-Shop Scheduling with Time-Dependent Costs and Cardinality Resource Constraints.
.- On the Virtual Network Embedding polytope.
.- Differentiable Quadratic Optimization with Semidefinite Programming Initializations: A Case Study on Maximum Independent Set.
.- Global Optimization for Combinatorial Geometry Problems Revisited in the Era of LLMs.
.- Combinatorial Optimization.
.- A Machine Learning Framework for Dominating Set Variants in Combinatorial Optimization.
.- Sequential Linear Contracts on Matroids.
.- Simultaneous Lot Sizing and Scheduling for a Production Planning Problem Including Shift and Overtime Decisions.
.- The Curriculum Prioritization Problem: A solution approach based on the Knapsack Problem with Scheduled Items.
.- GPU-Accelerated Harris Hawks Optimization with Robust Tabu Search for Solving Quadratic Assignment Problems.
.- Polyhedral Combinatorics.
.- On the co-?-plex polytopes of trees.
.- On disjunction convex hulls for generalized cross polytopes.
.- The Chvátal Rank of 2-Dimensional Integer-Free Polyhedra.
.- Facet-Defining Inequalities for the Angle-Based DC Optimal Transmission Switching Formulation.
.- Complexity.
.- A Practical FPT Algorithm for Treedepth.
.- The Falsification Problem: How Hard Is It to Falsify Heuristics?
.- Line-Constrained k-Semi-Obnoxious Facility Location.
.- Computational Hardness and Approximation Limits of the Co-Path Set Problem in Bipartite Graphs.
.- Approximation Algorithms.
.- Minimizing the Weighted Makespan.
.- Approximation Algorithms for the b-Matching and List-Restricted Variants of MaxQAP.
.- Translocation Distance in Unary Encodings: Exact and Approximation Algorithms.
.- Network Design
.- On lower bounds for the minimum spectrum width for routing and spectrum assignment.
.- Minmax sink location problem on path networks with capacitated sinks.
.- Enhancing Resilience and Security in Multi-band Flexible-Grid Optical Networks: Combinatorial Optimization Perspective.
.- Cycle Basis-Driven ILP Bounds for the Minimum Branch Vertices Spanning Tree Problem.
.- Stochastic Optimization
.- Scenario-Based Stochastic Last-Mile Pharmaceutical Delivery: MILP Formulation.
.- Expected Cost of Greedy Online Facility Assignment on Regular Polygons.
.- Graphs and Combinatorics.
.- Cosigning Crossing Families and Outer-Planar Gadgets.
.- The Meta-rotation Poset for Student-Project Allocation.
.- Applications.
.- A Heuristic Approach for Balanced, Compact and Contiguous Districting.
.- Time-Dependent Carbon-Aware Electric Vehicle Routing for Last-Mile Delivery.
.- Automatic Value Optimization and Semantic Option Matching in Sports Betting Markets using Vector-Based Logical Containment Framework.
.- Electric Bus Scheduling and Charging Problem with Parking Constraints: Model and Heuristic.
.- Integrating crew scheduling and crew rostering for rail freight with train delays.
.- A new modeling approach to elective surgery scheduling.
.- Use of Unmanned Aerial Vehicles for Post-Disaster Response.
