Sublevel stope layout planning through a greedy heuristic approach based on dynamic programming.
Yuksel Asli SariMustafa KumralPublished in: J. Oper. Res. Soc. (2021)
Keyphrases
- greedy heuristic
- dynamic programming
- greedy algorithm
- knapsack problem
- np hard
- minimum weight
- worst case analysis
- heuristic search
- production planning
- objective function
- set cover
- single machine
- planning process
- stereo matching
- state space
- planning problems
- decision support
- linear programming
- scheduling problem
- decision making
- coarse to fine
- markov decision processes
- mixed initiative
- domain independent
- dynamic programming algorithms
- stochastic domains