Bin packing restricted to the AI instance class is solvable in polynomial time and to the ANI class in pseudopolynomial time, with algorithms that solve all known hard benchmarks far faster than prior exact methods.
Computational Optimization and Appli- cations 3, 111–130
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Polynomial and Pseudopolynomial Algorithms for Two Classes of Bin Packing Instances
Bin packing restricted to the AI instance class is solvable in polynomial time and to the ANI class in pseudopolynomial time, with algorithms that solve all known hard benchmarks far faster than prior exact methods.