An SDP relaxation with graph reduction and ADMM branch-and-bound solves the quadratic vertex-disjoint paths problem more effectively than Gurobi on tested instances.
A polynomial time algorithm for the k-disjoint shortest paths problem
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
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
SDP Approach to Quadratic Vertex-Disjoint Paths Problem
An SDP relaxation with graph reduction and ADMM branch-and-bound solves the quadratic vertex-disjoint paths problem more effectively than Gurobi on tested instances.