Railway scheduling using Boolean satisfiability modulo simulations
From MaRDI portal
Publication:6174526
DOI10.1007/978-3-031-27481-7_5zbMath1529.90042arXiv2212.05382MaRDI QIDQ6174526
Tomáš Kolárik, Stefan Ratschan
Publication date: 17 August 2023
Published in: Formal Methods (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.05382
Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Cites Work
- Unnamed Item
- Optimizing the simplon railway corridor
- Multi-agent pathfinding with continuous time
- Improving SAT Modulo ODE for Hybrid Systems Analysis by Combining Different Enclosure Methods
- Solving SAT and SAT Modulo Theories
- dReal: An SMT Solver for Nonlinear Theories over the Reals
- A Novel Approach to Strategic Planning of Rail Freight Transport
This page was built for publication: Railway scheduling using Boolean satisfiability modulo simulations