Asymptotic Analysis of a Greedy Heuristic for the Multi-Period Single-Sourcing Problem: The Acyclic Case.
H. Edwin RomeijnDolores Romero MoralesPublished in: J. Heuristics (2004)
Keyphrases
- asymptotic analysis
- greedy heuristic
- multi period
- np hard
- facility location problem
- fluid model
- greedy algorithm
- data envelopment analysis
- knapsack problem
- planning horizon
- production planning
- routing problem
- linear programming
- computational complexity
- learning algorithm
- lower bound
- reinforcement learning
- decision making