Matroids and the greedy algorithm
- Cite this article as:
- Edmonds, J. Mathematical Programming (1971) 1: 127. doi:10.1007/BF01584082
- 1.4k Downloads
Linear-algebra rank is the solution to an especially tractable optimization problem. This tractability is viewed abstractly, and extended to certain more general optimization problems which are linear programs relative to certain derived polyhedra.