Analytic proofs of a network feasibility theorem and a theorem of Fulkerson |
| |
| Authors: | David J Houck Arthur O Pittenger |
| |
| Institution: | Department of Mathematics University of Maryland Baltimore County 5401 Wilkens Avenue Baltimore, Maryland 21228, USA |
| |
| Abstract: | We provide an elementary proff of Fulkerson's theorem which gives the permutation matrices as extreme points of a certain unbounded convex polyhedron. An adaptation of the proof also establishes an analogous feasibility theorem for network flows which has Fulkerson's theorem as a corollary. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
