Speeding up branch and bound algorithms for solving the maximum clique problem
From MaRDI portal
Publication:2249809
Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Recommendations
- Improvements to MCS algorithm for the maximum clique problem
- Speeding up MCS algorithm for the maximum clique problem with ILS heuristic and other enhancements
- A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
- A simple and faster branch-and-bound algorithm for finding a maximum clique
- scientific article; zbMATH DE number 1947416
Cites work
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 5547826 (Why is no real title available?)
- scientific article; zbMATH DE number 4064507 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1947416 (Why is no real title available?)
- scientific article; zbMATH DE number 2040957 (Why is no real title available?)
- scientific article; zbMATH DE number 2079894 (Why is no real title available?)
- scientific article; zbMATH DE number 1384868 (Why is no real title available?)
- scientific article; zbMATH DE number 3404264 (Why is no real title available?)
- A hybrid heuristic for the maximum clique problem
- A neural algorithm for the maximum clique problem: Analysis, experiments, and circuit implementation
- A new table of constant weight codes
- A simple and faster branch-and-bound algorithm for finding a maximum clique
- Algorithm 457: finding all cliques of an undirected graph
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- An exact algorithm for the maximum clique problem
- An improved branch and bound algorithm for the maximum clique problem
- Clique-detection models in computational biochemistry and genomics
- Fast local search for the maximum independent set problem
- Finding a Maximum Clique in an Arbitrary Graph
- Greedy randomized adaptive search procedures
- Large Cliques Elude the Metropolis Process
- Reducibility among combinatorial problems
- Simple ingredients leading to very efficient heuristics for the maximum clique problem
- Sur le coloriage des graphs
Cited in
(16)- Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound
- Dynamic node packing
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming
- Ulam stability of a functional equation deriving from quadratic and additive mappings in random normed spaces
- Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
- Speeding up MCS algorithm for the maximum clique problem with ILS heuristic and other enhancements
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- Principles and Practice of Constraint Programming – CP 2004
- CliSAT: a new exact algorithm for hard maximum clique problems
- Improvements to MCS algorithm for the maximum clique problem
- Maximum clique via \textsc{MaxSat} and back again
- The stable set problem: clique and nodal inequalities revisited
- A review on algorithms for maximum clique problems
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
This page was built for publication: Speeding up branch and bound algorithms for solving the maximum clique problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249809)
