From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem.
Jochen KönemannStefano LeonardiGuido SchäferStefan H. M. van ZwamPublished in: ICALP (2005)
Keyphrases
- primal dual
- linear programming
- lp relaxation
- linear program
- interior point
- integrality gap
- valid inequalities
- interior point methods
- linear programming problems
- semidefinite programming
- convex optimization
- algorithm for linear programming
- linear programming relaxation
- feasible solution
- optimal solution
- integer programming
- column generation
- approximation algorithms
- convergence rate
- integer programming formulation
- np hard
- quadratic programming
- integer program
- minimum cost
- energy minimization
- dynamic programming
- low degree
- objective function
- image processing
- lagrangian relaxation
- special case