Combinatorial interior point methods for generalized network flow problems.
Donald GoldfarbYiqing LinPublished in: Math. Program. (2002)
Keyphrases
- interior point methods
- network flow problem
- convex optimization
- linear program
- primal dual
- linear programming
- network design problem
- interior point
- semidefinite programming
- mixed integer
- linear programming problems
- quadratic programming
- network flow
- minimum cost
- minimal cost
- solving problems
- np hard
- computationally intensive
- approximation algorithms
- convex hull
- network design
- worst case
- training samples
- feasible solution