Set covering heuristics in a benders decomposition for railway timetabling
From MaRDI portal
Publication:6047880
DOI10.1016/j.cor.2023.106339OpenAlexW4382933233MaRDI QIDQ6047880
Francesco Corman, Florin Leutwiler
Publication date: 13 September 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2023.106339
Cites Work
- Unnamed Item
- Improving Benders decomposition using a genetic algorithm
- Partitioning procedures for solving mixed-variables programming problems
- Disjunctive programming: Properties of the convex hull of feasible points
- Application of an iterative framework for real-time railway rescheduling
- A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations
- A decomposition based hybrid heuristic algorithm for the joint passenger and freight train scheduling problem
- Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling
- A model predictive control approach for discrete-time rescheduling in complex central railway station areas
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- A logic-based Benders decomposition for microscopic railway timetable planning
- Dispatching and coordination in multi-area railway traffic management
- A branch and bound algorithm for scheduling trains in a railway network
- A Lagrangian heuristic algorithm for a real-world train timetabling problem
- Generalized Benders decomposition
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Reformulation and Decomposition of Integer Programs
- A Greedy Heuristic for the Set-Covering Problem
- A machine program for theorem-proving
- Fast and Flexible Difference Constraint Propagation for DPLL(T)
