Extended and discretized formulations for the maximum clique problem
From MaRDI portal
Publication:2655650
Recommendations
- An extended formulation approach to the edge-weighted maximal clique problem
- On solving the maximum clique problem
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
- scientific article; zbMATH DE number 956840
Cites work
- A Convex Quadratic Characterization of the Lovász Theta Number
- A fast algorithm for the maximum clique problem
- A heuristic for the stability number of a graph based on convex quadratic programming and tabu search
- A multi-KP modeling for the maximum-clique problem
- A note on the approximation of the MAX CLIQUE problem
- A sequential elimination algorithm for computing bounds on the clique number of a graph
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- Approximation of the stability number of a graph via copositive programming
- Clique relaxations in social network analysis: the maximum k-plex problem
- Clique-detection models in computational biochemistry and genomics
- Complex networks: structure and dynamics
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- Geometric algorithms and combinatorial optimization
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 1306875 (Why is no real title available?)
- scientific article; zbMATH DE number 1947416 (Why is no real title available?)
- Optimal Protein Structure Alignment Using Maximum Cliques
- Reactive local search for the maximum clique problem
- Simple ingredients leading to very efficient heuristics for the maximum clique problem
- Variable neighborhood search for the maximum clique
Cited in
(20)- An extended formulation approach to the edge-weighted maximal clique problem
- Complete formulations of polytopes related to extensions of assignment matrices
- Cliques with maximum/minimum edge neighborhood and neighborhood density
- Maximum dispersion and geometric maximum weight cliques
- Enhancing discretized formulations: the knapsack reformulation and the star reformulation
- Worst-case analysis of clique MIPs
- Continuous cubic formulations for cluster detection problems in networks
- Numerical experiments with LP formulations of the maximum clique problem
- Concise integer linear programming formulation for clique partitioning problems
- 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
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
- A review on algorithms for maximum clique problems
- A discrete and continuous study of the \textsc{Max-Chain-Formation} problem
- 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
- Two-phase heuristics for the \(k\)-club problem
- Integer models and upper bounds for the 3-club problem
- Upper bounds and heuristics for the 2-club problem
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
This page was built for publication: Extended and discretized formulations for the maximum clique problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2655650)
