A branch-and-cut algorithm for the pallet loading problem.
Ramón Alvarez-ValdésFrancisco ParreñoJosé Manuel TamaritPublished in: Comput. Oper. Res. (2005)
Keyphrases
- experimental evaluation
- expectation maximization
- times faster
- improved algorithm
- matching algorithm
- k means
- computational cost
- optimization algorithm
- learning algorithm
- linear programming
- high accuracy
- worst case
- dynamic programming
- significant improvement
- preprocessing
- computational complexity
- optimal solution
- clustering method
- particle swarm optimization
- space complexity
- simulated annealing
- np hard
- cost function
- search space
- tree structure
- multiscale
- data structure
- selection algorithm
- recognition algorithm
- path planning
- evolutionary algorithm
- classification algorithm
- input data
- ant colony optimization
- experimental study
- segmentation algorithm
- scheduling problem
- maximum likelihood