Solving a known MILP with CP-SAT proves optimal for all 4,320 dense benchmark instances, averages 1.3 seconds, and stays competitive on sparse instances with a 0.7 percent average gap.
A reactive local search-based algorithm for the disjunctively constrained knapsack problem,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On Solving the Knapsack Problem with Conflicts
Solving a known MILP with CP-SAT proves optimal for all 4,320 dense benchmark instances, averages 1.3 seconds, and stays competitive on sparse instances with a 0.7 percent average gap.