Some Abstract Pivot Algorithms (REVISED)
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 b...
Main Authors: | Green, Curtis, Magnanti, Thomas L. |
---|---|
Format: | Working Paper |
Language: | en_US |
Published: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
Online Access: | http://hdl.handle.net/1721.1/5353 |
Similar Items
-
Some Abstract Pivot Algorithms
by: Green, Curtis, et al.
Published: (2004) -
Parametric Linear Programming and Anti-Cycling Pivoting Rules
by: Magnanti, Thomas L., et al.
Published: (2004) -
Duality and Sensitivity Analysis for Fractional Programs (REVISED)
by: Bitran, Gabriel R., et al.
Published: (2004) -
The MOOC pivot
by: Reich, Justin, et al.
Published: (2021) -
The MOOC pivot
by: Reich, Justin, et al.
Published: (2022)