A general heuristic for two-dimensional nesting problems with limited-size containers.
Leandro Resende MundimMarina AndrettaMaria Antónia CarravillaJosé Fernando OliveiraPublished in: Int. J. Prod. Res. (2018)
Keyphrases
- packing problem
- three dimensional
- decision problems
- search algorithm
- sequencing problems
- neural network
- computationally hard
- specific problems
- closely related
- dynamic programming
- linear program
- metaheuristic
- combinatorial optimization
- benchmark problems
- heuristic methods
- solving problems
- np complete
- difficult problems
- simulated annealing
- exact and approximate
- running times
- multi dimensional
- optimal or near optimal