Efficient lower bounds and heuristics for the variable cost and size bin packing problem.
Teodor Gabriel CrainicGuido PerboliWalter ReiRoberto TadeiPublished in: Comput. Oper. Res. (2011)
Keyphrases
- lower bound
- running times
- upper bound
- optimal cost
- set of randomly generated instances
- branch and bound algorithm
- space requirements
- worst case
- objective function
- np hard
- variable ordering
- branch and bound
- lower and upper bounds
- learning algorithm
- lower bounding
- constant factor
- computational complexity
- total cost
- maintenance cost
- storage cost
- random instances
- search effort