An adaptive multistart tabu search approach to solve the maximum clique problem
From MaRDI portal
(Redirected from Publication:358651)
Recommendations
Cites work
- scientific article; zbMATH DE number 5547826 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (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 939919 (Why is no real title available?)
- scientific article; zbMATH DE number 956867 (Why is no real title available?)
- A branch and cut solver for the maximum stable set problem
- A fast algorithm for the maximum clique problem
- A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere
- A hybrid heuristic for the maximum clique problem
- A new trust region technique for the maximum weight clique problem
- A novel evolutionary formulation of the maximum independent set problem
- An effective heuristic algorithm for sum coloring of graphs
- An effective local search for the maximum clique problem
- An exact algorithm for the maximum clique problem
- Coloring large graphs based on independent set extraction
- Finding a Maximum Clique in an Arbitrary Graph
- Hybrid evolutionary algorithms for graph coloring
- Phased local search for the maximum clique problem
- Reactive and dynamic local search for max-clique: engineering effective building blocks
- Reactive local search for the maximum clique problem
- Reducibility among combinatorial problems
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- Simple ingredients leading to very efficient heuristics for the maximum clique problem
- Solving the maximum clique problem using a tabu search approach
- The maximum clique problem
Cited in
(26)- Team selection for prediction tasks
- A branch-and-cut algorithm for the edge interdiction clique problem
- Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- Subgraph extraction and metaheuristics for the maximum clique problem
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem
- A new branch-and-bound algorithm for the maximum weighted clique problem
- An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem†
- Detecting robust cliques in graphs subject to uncertain edge failures
- A three-phased local search approach for the clique partitioning problem
- Clustered maximum weight clique problem: algorithms and empirical analysis
- Frequency-driven tabu search for the maximum \(s\)-plex problem
- An opposition-based memetic algorithm for the maximum quasi-clique problem
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network
- Breakout local search for maximum clique problems
- A scatter search algorithm for the maximum clique problem
- An enhanced bitstring encoding for exact maximum clique search in sparse graphs
- A new exact maximum clique algorithm for large and massive sparse graphs
- A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems
- Multi-neighborhood tabu search for the maximum weight clique problem
- CliSAT: a new exact algorithm for hard maximum clique problems
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
- Local search for diversified top-\(k\) clique search problem
- A Metaheuristic Approach for an Optimized Design of a Silicon Carbide Operational Amplifier
- A review on algorithms for maximum clique problems
- Learning driven three-phase search for the maximum independent union of cliques problem
This page was built for publication: An adaptive multistart tabu search approach to solve the maximum clique problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q358651)
