A MaxSAT approach for solving a new dynamic discretization discovery model for train rescheduling problems

DOI10.1016/j.cor.2024.106679MaRDI QIDQ6568503

Paolo Ventura, Bjørnar Luteberget, Carlo Mannino, Anna Livia Croella

Publication date: 8 July 2024

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

maximum satisfiability problemtrain reschedulingdynamic discretization discovery

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Title not available (Why is that?)
• A set packing inspired method for real-time junction train routing
• A model predictive control approach for discrete-time rescheduling in complex central railway station areas
• Job-shop scheduling with blocking and no-wait constraints
• Perspectives on integer programming for time-dependent models
• Assessing progress in SAT solvers through the Lens of incremental SAT
• A logic-based Benders decomposition for microscopic railway timetable planning
• Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
• A time bucket formulation for the traveling salesman problem with time windows
• Optimal Real-Time Traffic Control in Metro Stations
• An Exact Decomposition Approach for the Real-Time Train Dispatching Problem
• Light Robustness
• The Continuous-Time Service Network Design Problem
• Train Scheduling with Hybrid Answer Set Programming
• RC2: an Efficient MaxSAT Solver

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)