| dc.contributor.author | Green, Curtis | en_US |
| dc.contributor.author | Magnanti, Thomas L. | en_US |
| dc.date.accessioned | 2004-05-28T19:23:43Z | |
| dc.date.available | 2004-05-28T19:23:43Z | |
| dc.date.issued | 1974-02 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/5113 | |
| dc.description.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. | en_US |
| dc.format.extent | 1744 bytes | |
| dc.format.extent | 1834459 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Massachusetts Institute of Technology, Operations Research Center | en_US |
| dc.relation.ispartofseries | Operations Research Center Working Paper;OR 031-74 | en_US |
| dc.title | Some Abstract Pivot Algorithms | en_US |
| dc.type | Working Paper | en_US |
