User menu

Fractional Covers for Forests and Matchings

Bibliographic reference Padberg, M.W. ; Wolsey, Laurence. Fractional Covers for Forests and Matchings. In: Mathematical Programming, Vol. 29, no. 1, p. 1-14 (1984)
Permanent URL
  1. C. Berge,Graphs and hypergraphs (North-Holland, Amsterdam, 1973).
  2. W.H. Cunningham, “Testing membership in matroid polyhedra”. Technical Report 81207-OR, Institut für Operations Research, Universitát Bonn (1981); to appear inJournal of Combinatorial Theory B.
  3. Edmonds Jack, Maximum matching and a polyhedron with 0,1-vertices, 10.6028/jres.069b.013
  4. J. Edmonds, “Submodular functions, matroids and certain polyhedra”, in: R. Guy, H. Hanani, N. Sauer and J. Schonheim, eds.Combinatorial structures and their applications. (Gordon and Breach, New York, 1969).
  5. D.R. Fulkerson, “Blcoking and antiblocking pairs of polyhedra”,Mathematical Programming 1 (1971) 168–194.
  6. Gács Peter, Lovász Laszlo, Khachiyan’s algorithm for linear programming, Mathematical Programming Studies (1981) ISBN:9783642008054 p.61-68, 10.1007/bfb0120921
  7. M. Grötschel, L. Lovász and A. Schrijver, “The ellipsoid method and its consequences in combinatorial optimization”,Combinatorica 1 (1981) 169–197.
  8. P. Hansen, “Method of nonlinear 0–1 programming”,Annals of Discrete Mathematics 5 (1979) 53–70.
  9. L.G. Khachian, “A polynomial algorithm in linear programming”,Doklady Akademii Nauk USSR 244 (1979). Translated inSoviet Mathematics Doklady 20 (1979) 191–194.
  10. M.W. Padberg and M.R. Rao, “The Russian method for linear inequalities III: Bounded integer programming”, GBA Working Paper, New York University, May, 1981.
  11. M.W. Padberg and L.A. Wolsey, “Trees and cuts”. CORE Discussion Paper 8138. October, 1981.
  12. M.W. Padberg and M.R. Rao, “Odd minimum cut-sets and b-matching”,Mathematics of Operations Research 7 (1982) 67–80.
  13. J.C. Picard and H.D. Ratcliff, “Minimum cuts and related problems”,Networks 5 (1975) 357–370.
  14. J.C. Picard and M. Queyranne, “Selected applications of minimum cuts in networks”,Infor 20 (1982) 394–422.
  15. D.B. Weinberger, “Network flows minimum coverings and the four-color conjecture”,Operations Research 24 (1976) 272–290.