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.
INFORMS Journal on Computing 32, 428–443
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
RECORD introduces multiplicity reduction, on-the-fly aggregation, refined dominance fixing, and a new divisibility bound to outperform COMBO and BOUKNAP by orders of magnitude on hard KP and BKP benchmark instances.
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.
-
Solving Hard Instances from Knapsack and Bounded Knapsack Problems: A new state-of-the-art solver
RECORD introduces multiplicity reduction, on-the-fly aggregation, refined dominance fixing, and a new divisibility bound to outperform COMBO and BOUKNAP by orders of magnitude on hard KP and BKP benchmark instances.