mlsanityData to 7 Oct 2026

Hybrid Approach for Solving Real-World Bin Packing Problem Instances Using Quantum Annealers

arXiv 2303.01977 ↗First posted 1 Mar 2023cs.ET cs.AI quant-phcited by 7

Not on the map. Why?

Abstract (arXiv)

Efficient packing of items into bins is a common daily task. Known as Bin Packing Problem, it has been intensively studied in the field of artificial intelligence, thanks to the wide interest from industry and logistics. Since decades, many variants have been proposed, with the three-dimensional Bin Packing Problem as the closest one to real-world use cases. We introduce a hybrid quantum-classical framework for solving real-world three-dimensional Bin Packing Problems (Q4RealBPP), considering different realistic characteristics, such as: i) package and bin dimensions, ii) overweight restrictions, iii) affinities among item categories and iv) preferences for item ordering. Q4RealBPP permits the solving of real-world oriented instances of 3dBPP, contemplating restrictions well appreciated by industrial and logistics sectors.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 2 of its 37 references that are in the map. First posted on arXiv 1 Mar 2023.

Builds on

2 of 37 references.

References · 2

  1. 2013Ising formulations of many NP problemscited by 204
  2. 2020Quantum Computing: A Taxonomy, Systematic Review and Future Directionscited by 16

Built on by

Cited by year

Citing papers per year: 2023: 2; 2024: 3; 2025: 2.

7 papers.