Lower bounds for a bin packing problem with linear usage cost.
Roland BraunePublished in: Eur. J. Oper. Res. (2019)
Keyphrases
- lower bound
- optimal cost
- upper bound
- branch and bound
- np hard
- branch and bound algorithm
- optimal solution
- lower and upper bounds
- worst case
- minimum cost
- objective function
- total cost
- constant factor
- lower bounding
- upper and lower bounds
- high cost
- linear programming relaxation
- quadratic assignment problem
- cost sensitive
- optimization problems
- cost function
- min sum