A Branch-and-Cut Approach for Solving Railway Line-Planning Problems.
Jan-Willem GoossensStan P. M. van HoeselLeo G. KroonPublished in: Transp. Sci. (2004)
Keyphrases
- planning problems
- solving planning problems
- domain independent
- heuristic search
- state space
- planning systems
- ai planning
- planning domains
- probabilistic planning
- sat encodings
- domain independent planning
- concurrent actions
- causal graph
- fully observable
- dynamic programming
- hidden markov models
- stochastic domains
- optimal planning
- deterministic domains
- orders of magnitude
- plan generation
- classical planning
- general purpose
- linear programming