A flow-based MILP reformulation for graph inspection planning solves problems with up to 15,000 vertices and reduces optimality gaps by 30-50% on large instances.
A greedy approximation algorithm for the group steiner problem.Discrete Applied Mathematics, 154 (1):15–34, 2006
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.RO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Scalable Inspection Planning via Flow-based Mixed Integer Linear Programming
A flow-based MILP reformulation for graph inspection planning solves problems with up to 15,000 vertices and reduces optimality gaps by 30-50% on large instances.