Bin Packing Problem (BPP)

The Bin Packing Problem (BPP) is a combinatorial optimization problem that involves packing a set of items of varying sizes into a finite number of bins of fixed capacity in a way that minimizes the number of bins used, and it is used to evaluate the effectiveness of optimization algorithms.

Papers using Bin Packing Problem (BPP) (2)

Qubit-Efficient QUBO Formulation for Constrained Optimization Problems2025Transfer learning of optimal QAOA parameters in combinatorial optimization2024 · 3 cites