| dc.creator |
Green, Curtis |
|
| dc.creator |
Magnanti, Thomas L. |
|
| dc.date |
2004-05-28T19:35:15Z |
|
| dc.date |
2004-05-28T19:35:15Z |
|
| dc.date |
1974-08 |
|
| dc.date.accessioned |
2013-10-09T02:39:17Z |
|
| dc.date.available |
2013-10-09T02:39:17Z |
|
| dc.date.issued |
2013-10-09 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/5353 |
|
| dc.identifier.uri |
http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
|
| dc.description |
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. |
|
| dc.description |
Supported in part by the U.S. Army Research Office (Durham) under Contract No. DAHCO4-73-0032 |
|
| dc.format |
1746 bytes |
|
| dc.format |
1467392 bytes |
|
| dc.format |
application/pdf |
|
| dc.language |
en_US |
|
| dc.publisher |
Massachusetts Institute of Technology, Operations Research Center |
|
| dc.relation |
Operations Research Center Working Paper;OR 037-74 |
|
| dc.title |
Some Abstract Pivot Algorithms (REVISED) |
|
| dc.type |
Working Paper |
|