Mixed integer linear programming formulation for flexibility instruments in capacity planning problems.
Dariush Tavaghof-GiglooStefan MinnerLena SilbermayrPublished in: Comput. Ind. Eng. (2016)
Keyphrases
- mixed integer linear programming
- planning problems
- branch and bound algorithm
- cutting plane
- heuristic search
- mixed integer linear program
- state space
- mathematical programming
- domain independent
- mixed integer
- ai planning
- production planning
- planning domains
- solving planning problems
- planning systems
- partial observability
- deterministic domains
- lower bound
- mixed integer nonlinear programming
- branch and bound
- classical planning
- domain specific
- knapsack problem
- approximate solutions
- search algorithm
- search strategy
- integer program
- probability distribution
- htn planning