Comparative Benchmark of a Quantum Algorithm for the Bin Packing Problem.
Mikel Garcia de AndoinIzaskun OregiEsther Villar-RodriguezEneko OsabaMikel SanzPublished in: SSCI (2022)
Keyphrases
- dynamic programming
- learning algorithm
- experimental evaluation
- preprocessing
- optimization algorithm
- np hard
- bin packing
- optimal solution
- recognition algorithm
- k means
- significant improvement
- cost function
- computational cost
- simulated annealing
- theoretical analysis
- expectation maximization
- high accuracy
- data sets
- particle swarm optimization algorithm
- detection algorithm
- improved algorithm
- computational complexity
- quantum inspired
- face recognition
- packing problem
- knapsack problem
- convergence rate
- convex hull
- times faster
- matching algorithm
- ant colony optimization
- lower bound
- segmentation algorithm
- probabilistic model
- worst case