Approximation algorithms for the generalized incremental knapsack problem.
Yuri FaenzaDanny SegevLingyi ZhangPublished in: Math. Program. (2023)
Keyphrases
- approximation algorithms
- knapsack problem
- np hard
- exact algorithms
- special case
- optimal solution
- combinatorial optimization problems
- worst case
- minimum cost
- set cover
- vertex cover
- multidimensional knapsack problem
- greedy algorithm
- approximation ratio
- greedy heuristic
- linear programming relaxation
- production planning
- network design problem
- dynamic programming
- optimization problems
- open shop
- constant factor
- linear programming
- scheduling problem
- undirected graph
- greedy algorithms
- lower bound
- randomized algorithms
- disjoint paths
- precedence constraints
- cutting plane
- primal dual
- branch and bound algorithm
- constraint satisfaction problems
- constant factor approximation
- polynomial time approximation
- computational complexity
- integer programming
- upper bound
- evolutionary algorithm
- maximum profit