An extended formulation approach to the edge-weighted maximal clique problem
Authors:
- Kyungchul ParkKPKyungchul Park
- Kyungsik LeeKLKyungsik Lee
- Sungsoo ParkSPSungsoo Park
- 1 December 1996
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 95 (3) , 671-682
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Weighted k‐cardinality trees: Complexity and polyhedral structureNetworks, 1994
- A cutting-plane approach to the edge-weighted maximal clique problemEuropean Journal of Operational Research, 1993
- Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean FunctionsMathematics of Operations Research, 1993
- Min-cut clusteringMathematical Programming, 1993
- Facets for the cut cone II: Clique-web inequalitiesMathematical Programming, 1992
- Facets for the cut cone IMathematical Programming, 1992
- The cut polytope and the Boolean quadric polytopeDiscrete Mathematics, 1990
- The boolean quadric polytope: Some characteristics, facets and relativesMathematical Programming, 1989
- Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphsMathematical Methods of Operations Research, 1985
- The perfectly matchable subgraph polytope of a bipartite graphNetworks, 1983