A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems.

Lijun Wei Zhixing Luo Roberto Baldacci Andrew Lim

Published in: INFORMS J. Comput. (2020)

Keyphrases

packing problem
bin packing
learning algorithm
optimal solution
computational complexity
preprocessing
search space
cost function
worst case
np hard
segmentation algorithm
simulated annealing
linear programming
dynamic programming
detection algorithm
k means
image segmentation