one-dimensional Bin Packing Problem

The one-dimensional Bin Packing Problem 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.

Papers using one-dimensional Bin Packing Problem (2)

Qoptlib: A Quantum Computing Oriented Benchmark For Combinatorial Optimization Problems2024 · 11 citesQOPTLib: a Quantum Computing Oriented Benchmark for Combinatorial Optimization Problems2024