New facets and a branch-and-cut algorithm for the weighted clique problem
暂无分享,去创建一个
[1] George L. Nemhauser,et al. Min-cut clustering , 1993, Math. Program..
[2] Sungsoo Park,et al. An extended formulation approach to the edge-weighted maximal clique problem , 1996 .
[3] Michael Malmros Sørensen,et al. b-Tree Facets for the Simple Graph Partitioning Polytope , 2004, J. Comb. Optim..
[4] Michael Sørensen. Polyhedral Computations for the Simple Graph Partitioning Problem , 2005 .
[5] Cid C. de Souza,et al. The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations , 2000, Eur. J. Oper. Res..
[6] Ulrich Faigle,et al. A Lagrangian relaxation approach to the edge-weighted clique problem , 2001, Eur. J. Oper. Res..
[7] Hanif D. Sherali,et al. A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope , 1995, Oper. Res. Lett..
[8] Anuj Mehrotra. Cardinality Constrained Boolean Quadratic Polytope , 1997, Discret. Appl. Math..
[9] Ulrich Faigle,et al. LP-relaxation for the edge-weighted subclique problem , 1994 .
[10] Ulrich Faigle,et al. A cutting-plane approach to the edge-weighted maximal clique problem , 1993 .
[11] Michael Jünger,et al. Operations Research ’93 , 1994 .
[12] Helmuth Späth,et al. Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs , 1985, Z. Oper. Research.
[13] Manfred W. Padberg,et al. The boolean quadric polytope: Some characteristics, facets and relatives , 1989, Math. Program..
[14] Martin W. P. Savelsbergh,et al. A Computational Study of Search Strategies for Mixed Integer Programming , 1999, INFORMS J. Comput..
[15] Yoshiko Wakabayashi,et al. A cutting plane algorithm for a clustering problem , 1989, Math. Program..