A branch-and-price algorithm for the temporal bin packing problem.
Mauro Dell'AmicoFabio FuriniManuel IoriPublished in: Comput. Oper. Res. (2020)
Keyphrases
- bin packing
- high accuracy
- cost function
- computationally efficient
- improved algorithm
- detection algorithm
- computational complexity
- k means
- expectation maximization
- probabilistic model
- linear programming
- optimization algorithm
- theoretical analysis
- input data
- dynamic programming
- np hard
- hidden markov models
- optimal solution
- objective function
- learning algorithm
- computational cost
- neural network
- lower bound
- segmentation algorithm
- preprocessing
- path planning
- spatial and temporal
- combinatorial optimization
- temporal information
- convex hull