A MaxSAT approach for solving a new dynamic discretization discovery model for train rescheduling problems
From MaRDI portal
Publication:6568503
DOI10.1016/J.COR.2024.106679MaRDI QIDQ6568503FDOQ6568503
Authors: Anna Livia Croella, Bjørnar Luteberget, Carlo Mannino, P. Ventura 
Publication date: 8 July 2024
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- RC2: an efficient MaxSAT solver
- Light robustness
- A model predictive control approach for discrete-time rescheduling in complex central railway station areas
- Optimal real-time traffic control in metro stations
- A set packing inspired method for real-time junction train routing
- A time bucket formulation for the traveling salesman problem with time windows
- Job-shop scheduling with blocking and no-wait constraints
- A logic-based Benders decomposition for microscopic railway timetable planning
- The Continuous-Time Service Network Design Problem
- An exact decomposition approach for the real-time train dispatching problem
- Handbook of satisfiability. In 2 parts
- Assessing progress in SAT solvers through the Lens of incremental SAT
- Perspectives on integer programming for time-dependent models
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
- Train scheduling with hybrid answer set programming
This page was built for publication: A MaxSAT approach for solving a new dynamic discretization discovery model for train rescheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568503)
