Some Abstract Pivot Algorithms (REVISED)
Name
OR-037-74.pdf
Size
1.4 MB
Format
Adobe PDF
Checksum (MD5)
13dca05435702a7b4c4d4fd8328d6709
Author(s)
Green, Curtis
Magnanti, Thomas L.
Date Issued
August 1974
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 037-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
