Some Abstract Pivot Algorithms
Name
OR-031-74.pdf
Size
1.75 MB
Format
Adobe PDF
Checksum (MD5)
840ded579928f0bf90cca4bdcae52601
Author(s) •
Green, Curtis
Magnanti, Thomas L.
Date Issued
February 1974
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 031-74
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link