Extensions of dynamic programming for multi-stage combinatorial optimization.
Michal MankowskiMikhail MoshkovPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- multistage
- combinatorial optimization
- dynamic programming
- combinatorial optimization problems
- production system
- combinatorial problems
- simulated annealing
- metaheuristic
- traveling salesman problem
- mathematical programming
- branch and bound
- optimization problems
- lot sizing
- stochastic programming
- single stage
- branch and bound algorithm
- state space
- stochastic optimization
- optimal control
- markov decision processes
- single machine scheduling problem
- lagrangian relaxation
- hard combinatorial optimization problems
- linear programming
- optimal policy
- linear program
- knapsack problem
- combinatorial search
- greedy algorithm
- attack detection
- search space
- max flow min cut
- infinite horizon
- single machine
- tabu search
- multi objective
- evolutionary algorithm