16 citations · 69 across the 7 of their papers we have counts for
Showing 2022 · quant-phShow all
2 papers · 2 filters
quant-ph2022★ 13 cited
Comparative Benchmark of a Quantum Algorithm for the Bin Packing Problem
Mikel Garcia-de-Andoin, Izaskun Oregi, Esther Villar-Rodriguez +2
The Bin Packing Problem (BPP) stands out as a paradigmatic combinatorial optimization problem in logistics. Quantum and hybrid quantum-classical algorithms are expected to show an…
quant-ph2022★ 16 cited
Hybrid Quantum-Classical Heuristic for the Bin Packing Problem
Mikel Garcia de Andoin, Eneko Osaba, Izaskun Oregi +2
Optimization problems is one of the most challenging applications of quantum computers, as well as one of the most relevants. As a consequence, it has attracted huge efforts to obt…