A combinatorial interior point method for network flow problems.
Claus WallacherUwe T. ZimmermannPublished in: Math. Program. (1992)
Keyphrases
- interior point methods
- network flow problem
- linear programming
- network flow
- linear program
- convex optimization
- minimum cost
- mixed integer
- minimal cost
- network design problem
- primal dual
- semidefinite programming
- np hard
- quadratic programming
- linear programming problems
- computationally intensive
- integer programming
- solving problems
- network design
- approximation algorithms
- training data
- simplex method