A compact CP-SAT model for shortest paths with arc-pair conflict penalties matches or improves existing solvers on benchmark instances, closing some instance groups for the first time.
Impossible pair constrained test path generation in a program,
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
background 1representative citing papers
citing papers explorer
-
On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts
A compact CP-SAT model for shortest paths with arc-pair conflict penalties matches or improves existing solvers on benchmark instances, closing some instance groups for the first time.