Faces for a linear inequality in 0–1 variables
暂无分享,去创建一个
[1] E. Balas,et al. Canonical Cuts on the Unit Hypercube , 1972 .
[2] Peter L. Hammer,et al. Facet of regular 0–1 polytopes , 1975, Math. Program..
[3] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..
[4] Leslie E. Trotter,et al. Properties of vertex packing and independence system polyhedra , 1974, Math. Program..
[5] Egon Balas,et al. Facets of the knapsack polytope , 1975, Math. Program..
[6] J. Trotter. Solution characteristics and algorithms for the vertex packing problem. , 1973 .
[7] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[8] V. Chvátal. On certain polytopes associated with graphs , 1975 .
[9] Laurence A. Wolsey,et al. Coefficient reduction for inequalities in 0–1 variables , 1974, Math. Program..