A branch-and-cut algorithm for the irregular strip packing problem with uncertain demands.
Layane Rodrigues de Souza QueirozMarina AndrettaPublished in: Int. Trans. Oper. Res. (2022)
Keyphrases
- theoretical analysis
- learning algorithm
- k means
- experimental evaluation
- preprocessing
- objective function
- np hard
- computational cost
- improved algorithm
- computational complexity
- search space
- cost function
- dynamic programming
- detection algorithm
- particle swarm optimization
- matching algorithm
- single pass
- times faster
- segmentation algorithm
- worst case
- optimal solution
- computationally efficient
- expectation maximization
- state space
- image segmentation
- convergence rate
- genetic algorithm
- data sets