Some Abstract Pivot Algorithms
Author(s)
Green, Curtis; Magnanti, Thomas L.
DownloadOR-031-74.pdf (1.749Mb)
Metadata
Show full item recordAbstract
Several problems in the theory of combinatorial geometries (or matroids) are solved by means of algorithms which involve the notion of "abstract pivots". The main example is the Edmonds-Fulkerson partition theorem, which is applied to prove a number of generalized exchange properties for bases.
Date issued
1974-02Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 031-74