Minimum cuts, modular functions, and matroid polyhedra

This publication has 7 references indexed in Scilit:

• Testing membership in matroid polyhedra
  Journal of Combinatorial Theory, Series B, 1984
• MATROIDS FROM CROSSING FAMILIES
  Published by Elsevier ,1984
• A network flow solution to some nonlinear 0‐1 programming problems, with applications to graph theory
  Networks, 1982
• The ellipsoid method and its consequences in combinatorial optimization
  Combinatorica, 1981
• Algorithmic versus axiomatic definitions of matroids
  Published by Springer Nature ,1981
• Maximal Closure of a Graph and Applications to Combinatorial Problems
  Management Science, 1976
• A Selection Problem of Shared Fixed Costs and Network Flows
  Management Science, 1970