Approximation Algorithms for a Two-Phase Knapsack Problem.
Kameng NipZhenbo WangPublished in: COCOON (2018)
Keyphrases
- approximation algorithms
- knapsack problem
- np hard
- optimal solution
- exact algorithms
- combinatorial optimization problems
- special case
- worst case
- production planning
- minimum cost
- lower bound
- set cover
- scheduling problem
- network design problem
- greedy algorithm
- approximation ratio
- vertex cover
- integer programming
- implicit enumeration
- linear programming
- branch and bound algorithm
- multidimensional knapsack problem
- dynamic programming
- optimization problems
- greedy heuristic
- linear programming relaxation
- computational complexity
- primal dual
- cutting plane
- precedence constraints
- constraint satisfaction problems
- open shop
- undirected graph
- linear program
- constant factor
- reinforcement learning
- randomized algorithms
- metaheuristic
- ant colony optimization
- branch and bound