Solving the known MILP for the Assignment Problem with Conflicts with Google's open-source CP-SAT solver matches or beats specialized exact and heuristic methods on literature benchmarks.
A branch-and-bound algorithm for the knapsack problem with conflict graph,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
On Solving the Assignment Problem with Conflicts
Solving the known MILP for the Assignment Problem with Conflicts with Google's open-source CP-SAT solver matches or beats specialized exact and heuristic methods on literature benchmarks.