Railway Scheduling Using Boolean Satisfiability Modulo Simulations.
Tomás KolárikStefan RatschanPublished in: CoRR (2022)
Keyphrases
- boolean satisfiability
- sat solvers
- boolean optimization
- probabilistic planning
- sat solving
- symmetry breaking
- randomly generated
- scheduling problem
- integer linear programming
- maximum satisfiability
- branch and bound algorithm
- sat problem
- max sat
- combinatorial problems
- phase transition
- job shop scheduling
- boolean formula
- orders of magnitude
- random sat instances
- constraint satisfaction
- evolutionary algorithm