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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2representative citing papers
citing papers explorer
-
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.
- Polynomial and Pseudopolynomial Algorithms for Two Classes of Bin Packing Instances