Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering.
Carsten FischerHeiko RöglinPublished in: CoRR (2015)
Keyphrases
- experimental evaluation
- learning algorithm
- objective function
- optimization algorithm
- improved algorithm
- times faster
- computational complexity
- computational cost
- np hard
- high accuracy
- theoretical analysis
- simulated annealing
- dynamic programming
- context free parsing
- probabilistic model
- search space
- linear programming
- input data
- similarity measure
- computationally efficient
- segmentation algorithm
- preprocessing
- recognition algorithm
- lower bound
- gradient projection
- dual formulation
- primal dual
- bayesian networks
- path planning
- particle swarm optimization
- neural network
- worst case
- k means
- multi objective