A Note on Clique-Web Facets for Multicut Polytopes
暂无分享,去创建一个
In this note we provide a previously undiscovered necessary condition for the facet-defining property of clique-web inequalities for the multicut polytope. This condition imposes a minimum cardinality requirement on the node set of the clique, thus implying, in general, that clique-web inequalities associated with relatively small cliques are not facet-defining for multicut polytopes.
[1] Michel Deza,et al. Facets for the cut cone I , 1992, Math. Program..
[2] Martin Grötschel,et al. Clique-Web Facets for Multicut Polytopes , 1992, Math. Oper. Res..
[3] Martin Grötschel,et al. Facets of the clique partitioning polytope , 1990, Math. Program..
[4] M. R. Rao,et al. The partition problem , 1993, Math. Program..
[5] Michel Deza,et al. Facets for the cut cone II: Clique-web inequalities , 1992, Math. Program..