Approximation algorithms for the square min-sum bin packing problem.
Rachel Vanucchi SaraivaRafael C. S. SchoueryPublished in: CoRR (2023)
Keyphrases
- approximation algorithms
- min sum
- np hard
- lower bound
- precedence constraints
- worst case
- knapsack problem
- upper bound
- optimal solution
- minimum cost
- branch and bound algorithm
- special case
- vertex cover
- branch and bound
- scheduling problem
- integer programming
- linear programming
- primal dual
- approximation ratio
- constant factor
- objective function
- lower and upper bounds
- constraint satisfaction problems
- bin packing
- computational complexity
- lagrangian relaxation
- linear program
- constant factor approximation
- goal programming
- undirected graph
- search space