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.
Fast Integer Linear Programming Based Models for VLSI Global Routing
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 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.