Railway Scheduling Using Boolean Satisfiability Modulo Simulations.
Tomás KolárikStefan RatschanPublished in: FM (2023)
Keyphrases
- boolean satisfiability
- sat solvers
- probabilistic planning
- boolean optimization
- sat solving
- scheduling problem
- branch and bound algorithm
- symmetry breaking
- integer linear programming
- sat problem
- randomly generated
- combinatorial problems
- maximum satisfiability
- max sat
- phase transition
- heuristic search
- metaheuristic
- learning algorithm
- column generation
- np complete
- random sat instances
- branch and bound
- combinatorial optimization
- lower bound
- optimal solution