Fully Polynomial Approximation Schemes for Locating a Tree-shaped Facility: a Generalization of the Knapsack Problem.
Arie TamirPublished in: Discret. Appl. Math. (1998)
Keyphrases
- knapsack problem
- approximation schemes
- tree shaped
- approximation algorithms
- optimal solution
- combinatorial optimization problems
- np hard
- dynamic programming
- exact algorithms
- optimization problems
- linear programming relaxation
- greedy heuristic
- greedy algorithm
- numerical methods
- multidimensional knapsack problem
- neural network
- maximum profit
- randomly generated test instances
- implicit enumeration
- bicriteria
- bin packing
- lp relaxation
- decision variables
- integer programming
- linear programming
- special case
- evolutionary algorithm
- lower bound
- multiscale