Extended and discretized formulations for the maximum clique problem
From MaRDI portal
Publication:2655650
DOI10.1016/j.cor.2009.10.010zbMath1192.90180OpenAlexW1995022503MaRDI QIDQ2655650
Publication date: 25 January 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.10.010
Related Items
A review on algorithms for maximum clique problems ⋮ Two-phase heuristics for the \(k\)-club problem ⋮ Complete formulations of polytopes related to extensions of assignment matrices ⋮ Integer models and upper bounds for the 3‐club problem ⋮ Enhancing discretized formulations: the knapsack reformulation and the star reformulation ⋮ On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs ⋮ An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem ⋮ Cliques with maximum/minimum edge neighborhood and neighborhood density ⋮ Upper bounds and heuristics for the 2-club problem ⋮ Solving the maximum edge-weight clique problem in sparse graphs with compact formulations ⋮ Maximum cut-clique problem: ILS heuristics and a data analysis application ⋮ A Full Description of Polytopes Related to the Index of the Lowest Nonzero Row of an Assignment Matrix ⋮ Worst-case analysis of clique MIPs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Variable neighborhood search for the maximum clique
- A heuristic for the stability number of a graph based on convex quadratic programming and tabu search
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- A sequential elimination algorithm for computing bounds on the clique number of a graph
- Simple ingredients leading to very efficient heuristics for the maximum clique problem
- A note on the approximation of the MAX CLIQUE problem
- Geometric algorithms and combinatorial optimization
- A multi-KP modeling for the maximum-clique problem
- A fast algorithm for the maximum clique problem
- Complex networks: structure and dynamics
- Clique-detection models in computational biochemistry and genomics
- Approximation of the Stability Number of a Graph via Copositive Programming
- Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
- Optimal Protein Structure Alignment Using Maximum Cliques
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- A Convex Quadratic Characterization of the Lovász Theta Number
- Reactive local search for the maximum clique problem
