Hybrid quantum-classical heuristic for the bin packing problem.
Mikel Garcia de AndoinEneko OsabaIzaskun OregiEsther Villar-RodriguezMikel SanzPublished in: GECCO Companion (2022)
Keyphrases
- bin packing
- packing problem
- quantum computation
- quantum mechanics
- optimal solution
- search algorithm
- combinatorial optimization
- lower bound
- dynamic programming
- simulated annealing
- quantum computing
- feasible solution
- parallel genetic algorithm
- greedy algorithm
- simulated annealing and tabu search
- exact algorithms
- tabu search
- neural network
- greedy heuristic
- search procedure
- hybrid approaches
- real time
- information retrieval