Minimum cuts, modular functions, and matroid polyhedra
- 1 June 1985
- Vol. 15 (2), 205-215
- https://doi.org/10.1002/net.3230150206
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Testing membership in matroid polyhedraJournal of Combinatorial Theory, Series B, 1984
- MATROIDS FROM CROSSING FAMILIESPublished by Elsevier BV ,1984
- A network flow solution to some nonlinear 0‐1 programming problems, with applications to graph theoryNetworks, 1982
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- Algorithmic versus axiomatic definitions of matroidsPublished by Springer Science and Business Media LLC ,1981
- Maximal Closure of a Graph and Applications to Combinatorial ProblemsManagement Science, 1976
- A Selection Problem of Shared Fixed Costs and Network FlowsManagement Science, 1970