Speeding up branch and bound algorithms for solving the maximum clique problem
DOI10.1007/S10898-013-0075-9zbMATH Open1294.05124OpenAlexW2013020979MaRDI QIDQ2249809FDOQ2249809
Mikhail Batsyn, Panos M. Pardalos, Evgeny Maslov
Publication date: 3 July 2014
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-013-0075-9
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
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)
Cites Work
- An improved branch and bound algorithm for the maximum clique problem
- Title not available (Why is that?)
- Algorithm 457: finding all cliques of an undirected graph
- Title not available (Why is that?)
- Reducibility among Combinatorial Problems
- Sur le coloriage des graphs
- Title not available (Why is that?)
- A hybrid heuristic for the maximum clique problem
- Clique-detection models in computational biochemistry and genomics
- Title not available (Why is that?)
- Finding a Maximum Clique in an Arbitrary Graph
- Greedy randomized adaptive search procedures
- Large Cliques Elude the Metropolis Process
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- An exact algorithm for the maximum clique problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- A simple and faster branch-and-bound algorithm for finding a maximum clique
- Title not available (Why is that?)
- Fast local search for the maximum independent set problem
- Simple ingredients leading to very efficient heuristics for the maximum clique problem
- A new table of constant weight codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- A neural algorithm for the maximum clique problem: Analysis, experiments, and circuit implementation
Cited In (13)
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming
- Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound
- Dynamic node packing
- 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
- 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
- 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
Uses Software
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)
