tight approximations for modular and submodular optimization with d-resource multiple knapsack constraints.
Yaron FairsteinAriel KulikHadas ShachnaiPublished in: CoRR (2020)
Keyphrases
- multiple knapsack
- combinatorial optimization problems
- branch and bound
- resource constraints
- lower bound
- greedy algorithm
- upper bound
- combinatorial optimization
- resource allocation
- resource allocation problems
- constraint satisfaction
- optimization problems
- global optimization
- min cost
- constraint programming
- branch and bound algorithm
- optimization process
- lower and upper bounds
- quadratic programming
- objective function