An extended formulation approach to the edge-weighted maximal clique problem

[1]  박경철,et al.  An Extended Formulation Approach to the Edge-weighted Maximal Clique Problem , 1995 .

[2]  S. S. Ravi,et al.  Heuristic and Special Case Algorithms for Dispersion Problems , 1994, Oper. Res..

[3]  George L. Nemhauser,et al.  Min-cut clustering , 1993, Math. Program..

[4]  Ulrich Faigle,et al.  A cutting-plane approach to the edge-weighted maximal clique problem , 1993 .

[5]  Endre Boros,et al.  Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions , 1993, Math. Oper. Res..

[6]  Michel Deza,et al.  Facets for the cut cone I , 1992, Math. Program..

[7]  Michel Deza,et al.  Facets for the cut cone II: Clique-web inequalities , 1992, Math. Program..

[8]  Caterina De Simone,et al.  The cut polytope and the Boolean quadric polytope , 1990, Discret. Math..

[9]  Manfred W. Padberg,et al.  The boolean quadric polytope: Some characteristics, facets and relatives , 1989, Math. Program..

[10]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[11]  G. D. Eppen,et al.  Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition , 1987, Oper. Res..

[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]  Egon Balas,et al.  The perfectly matchable subgraph polytope of a bipartite graph , 1983, Networks.

[14]  Matteo Fischetti,et al.  Weighted k-cardinality trees: Complexity and polyhedral structure , 1994, Networks.

[15]  G. Sigismondi.  A constraint generation algorithm for node packing , 1989 .