论文信息 - An Algorithm for the Unbounded Matroid Intersection Polyhedron - 字舞流文

An Algorithm for the Unbounded Matroid Intersection Polyhedron

An algorithmic relation, between results of Edmonds, Cunningham, McDiarmid and Groflin-Hoffman, is discussed.

András Frank | Éva Tardos | A. Frank | É. Tardos

[1] D. R. Fulkerson,et al. Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..

[2] Colin McDiarmid. Blocking, antiblocking, and pairs of matroids and polymatroids , 1978, J. Comb. Theory, Ser. B.

[3] Alan J. Hoffman,et al. On matroid intersections , 1981, Comb..

[4] J. Edmonds,et al. A Min-Max Relation for Submodular Functions on Graphs , 1977 .

[5] András Frank,et al. A Weighted Matroid Intersection Algorithm , 1981, J. Algorithms.

[6] W. H. Cunningham,et al. An Unbounded Matroid Intersection Polyhedron , 1977 .

[7] Alan J. Hoffman,et al. A generalization of max flow—min cut , 1974, Math. Program..