Dynamic programming approximation algorithms for the capacitated lot-sizing problem.
I. Esra BüyüktahtakinNing LiuPublished in: J. Glob. Optim. (2016)
Keyphrases
- approximation algorithms
- dynamic programming
- np hard
- worst case
- special case
- multi item
- minimum cost
- set cover
- linear programming
- vertex cover
- network design problem
- greedy algorithm
- state space
- primal dual
- reinforcement learning
- facility location problem
- open shop
- knapsack problem
- single machine
- multistage
- combinatorial auctions
- production planning
- markov decision processes
- approximation schemes
- infinite horizon
- lagrangian relaxation
- scheduling problem
- approximation ratio
- np hardness
- constant factor
- setup times
- precedence constraints
- optimal policy
- approximation guarantees
- undirected graph
- lower bound
- optimal solution