A logic-based Benders decomposition for microscopic railway timetable planning
From MaRDI portal
Publication:2158004
DOI10.1016/j.ejor.2022.02.043OpenAlexW4214479678MaRDI QIDQ2158004
Florin Leutwiler, Francesco Corman
Publication date: 22 July 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.02.043
Related Items
Set covering heuristics in a benders decomposition for railway timetabling, An optimization-based decision support tool for incremental train timetabling, Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut, Accelerating logic-based benders decomposition for railway rescheduling by exploiting similarities in delays
Cites Work
- Unnamed Item
- Partitioning procedures for solving mixed-variables programming problems
- Job-shop scheduling with multi-purpose machines
- Disjunctive programming: Properties of the convex hull of feasible points
- Logic-based Benders decomposition
- IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
- A decomposition based hybrid heuristic algorithm for the joint passenger and freight train scheduling problem
- Job-shop scheduling with blocking and no-wait constraints
- Iterative and core-guided maxsat solving: a survey and assessment
- Generalized Benders decomposition
- Railway Timetabling Using Lagrangian Relaxation
- Models for Railway Track Allocation
- An Exact Decomposition Approach for the Real-Time Train Dispatching Problem
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Planning and Scheduling by Logic-Based Benders Decomposition
- Modeling and Solving the Train Timetabling Problem
- GRASP: a search algorithm for propositional satisfiability
- A Tutorial on Satisfiability Modulo Theories
- Efficient Generation of Unsatisfiability Proofs and Cores in SAT
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
- A machine program for theorem-proving
- Fast and Flexible Difference Constraint Propagation for DPLL(T)
