Branch-and-price and beam search algorithms for the Variable Cost and Size Bin Packing Problem with optional items.
Mauro Maria BaldiTeodor Gabriel CrainicGuido PerboliRoberto TadeiPublished in: Ann. Oper. Res. (2014)
Keyphrases
- search algorithm
- variable sized
- heuristic search
- high cost
- maintenance cost
- computational complexity
- cost sensitive
- genetic algorithm
- lower bound
- cost reduction
- fixed cost
- expected cost
- search tree
- storage requirements
- minimum cost
- path finding
- tree search
- space requirements
- integer programming
- tabu search
- multi objective