Strongly Polynomial Simplex Algorithm for Bipartite Vertex Packing.
Ronald D. ArmstrongZhiying JinPublished in: Discret. Appl. Math. (1996)
Keyphrases
- strongly polynomial
- simplex algorithm
- linear programming
- linear program
- network simplex algorithm
- minimum cost flow
- undirected graph
- primal dual
- linear programming problems
- simplex method
- feasible solution
- optimal solution
- bipartite graph
- dynamic programming
- objective function
- np hard
- interior point methods
- directed graph
- column generation
- approximation algorithms
- quadratic programming
- semidefinite programming
- interior point
- graph partitioning
- integer programming
- shortest path algorithm
- cost function
- scheduling problem