A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation.
Sahar ChehrazadDirk RooseTony WautersPublished in: Eur. J. Oper. Res. (2022)
Keyphrases
- benchmark problems
- cost function
- learning algorithm
- test problems
- detection algorithm
- np hard
- search algorithm for solving
- memory efficient
- single pass
- experimental evaluation
- optimal solution
- globally optimal solutions
- continuous optimization
- search space
- computational complexity
- computational geometry
- exact solution
- combinatorial optimization
- optimization algorithm
- optimization problems
- worst case
- computational cost
- preprocessing
- neural network
- matching algorithm
- image segmentation
- continuous variables
- image sequences
- recognition algorithm
- np complete
- simulated annealing
- probabilistic model
- lower bound