The Asymptotic Worst-Case Behavior of the FFD Heuristic for Small Items.
Kaihong XuPublished in: J. Algorithms (2000)
Keyphrases
- linear programming
- worst case
- np hard
- optimal solution
- feasible solution
- dynamic programming
- worst case analysis
- running times
- average case
- lower bound
- greedy heuristic
- upper bound
- error bounds
- greedy algorithm
- approximation algorithms
- objective function
- asymptotic optimality
- simulated annealing
- asymptotically optimal
- state space
- behavior patterns
- genetic algorithm
- neural network