An Integer Interior Point Method for Min-Cost Flow Using Arc Contractions and Deletions.
Ruben BeckerAndreas KarrenbauerKurt MehlhornPublished in: CoRR (2016)
Keyphrases
- min cost
- interior point methods
- max flow
- convex programming
- network flow
- linear programming
- convex optimization
- quadratic programming
- primal dual
- combinatorial optimization problems
- linear program
- semidefinite programming
- interior point
- parallel processors
- approximation algorithms
- linear programming problems
- computationally intensive
- convex relaxation
- solving problems
- semidefinite
- energy minimization
- single processor
- special case
- integer programming
- dynamic programming
- optimization problems
- support vector machine