Facets of the independent path-matching polytope

Discrete Optimization - Tập 3 - Trang 111-122 - 2006
K.K.H. Cheung1
1School of Mathematics and Statistics, Carleton University, 1125 Colonel By Drive, Ottawa, ON K1S 5B6, Canada

Tài liệu tham khảo

Cook, 1998 Cunningham, 1997, The optimal path-matching problem, Combinatorica, 17, 315, 10.1007/BF01215915 Cunningham, 1978, A primal algorithm for optimum matching, Math. Program. Stud., 8, 50, 10.1007/BFb0121194 Edmonds, 1965, Maximum matching and a polyhedron with 0,1 vertices, J. Res. Natl. Bur. Stand. B, 69, 125, 10.6028/jres.069B.013 Edmonds, 1970, Submodular functions, matroids and certain polyhedra, 69 Frank, 2002, Note on the path-matching formula, J. Graph Theory, 41, 110, 10.1002/jgt.10055 F.R. Giles, Submodular functions, graphs and integer polyhedra, Ph.D. Thesis, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, 1975 Pulleyblank, 1974, Facets of 1-matching polyhedra, 214 Schrijver, 2003