Distributed Approximation Algorithms for the Multiple Knapsack Problem.
Ananth MurthyChandan YeshwanthShrisha RaoPublished in: CoRR (2017)
Keyphrases
- approximation algorithms
- knapsack problem
- np hard
- exact algorithms
- special case
- optimal solution
- combinatorial optimization problems
- worst case
- vertex cover
- optimization problems
- network design problem
- set cover
- approximation ratio
- dynamic programming
- minimum cost
- implicit enumeration
- linear programming relaxation
- lower bound
- open shop
- randomized algorithms
- computational complexity
- multidimensional knapsack problem
- production planning
- greedy algorithm
- maximum profit
- primal dual
- disjoint paths
- greedy heuristic
- precedence constraints
- cutting plane
- undirected graph
- branch and bound algorithm
- neural network
- integer programming
- simulated annealing
- constant factor approximation