A linear programming formulation of Mader's edge-disjoint paths problem.
Judith KeijsperRudi PendavinghLeen StougiePublished in: J. Comb. Theory, Ser. B (2006)
Keyphrases
- disjoint paths
- linear programming
- quadratic programming
- approximation algorithms
- semidefinite programming
- np hard
- linear program
- directed graph
- valid inequalities
- lp relaxation
- undirected graph
- quadratic program
- column generation
- feasible solution
- primal dual
- objective function
- integer programming
- constraint propagation
- network flow
- integer program
- minimum cost
- denoising