A study of ACO capabilities for solving the maximum clique problem
From MaRDI portal
Publication:2491340
Recommendations
- A New Approach for Solving the Maximum Clique Problem
- scientific article; zbMATH DE number 1961993
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- A hybrid heuristic for the maximum clique problem
- A review on algorithms for maximum clique problems
- Analysis of reactive search optimisation techniques for the maximum clique problem and applications. (Summary)
- Exact algorithms for maximum clique: a computational study
- A new algorithm for the maximum clique problem
Cites work
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- Adaptive, restart, randomized greedy heuristics for maximum clique
- An improved ant system algorithm for the vehicle routing problem
- Ant colonies for the quadratic assignment problem
- Approximation algorithms for combinatorial problems
- Bandwidth Packing: A Tabu Search Approach
- Evolutionary Computation in Combinatorial Optimization
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 41891 (Why is no real title available?)
- scientific article; zbMATH DE number 1961993 (Why is no real title available?)
- scientific article; zbMATH DE number 2079894 (Why is no real title available?)
- scientific article; zbMATH DE number 2079899 (Why is no real title available?)
- scientific article; zbMATH DE number 2086434 (Why is no real title available?)
- scientific article; zbMATH DE number 2086438 (Why is no real title available?)
- scientific article; zbMATH DE number 1424314 (Why is no real title available?)
- scientific article; zbMATH DE number 956843 (Why is no real title available?)
- scientific article; zbMATH DE number 956847 (Why is no real title available?)
- Reactive local search for the maximum clique problem
- Solving the maximum clique problem using a tabu search approach
- STABULUS: A technique for finding stable sets in large graphs with tabu search
Cited in
(15)- Simple ingredients leading to very efficient heuristics for the maximum clique problem
- A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators
- An ant colony optimization approach for the multidimensional knapsack problem
- Subgraph extraction and metaheuristics for the maximum clique problem
- A review on algorithms for maximum clique problems
- Maximum cut-clique problem: ILS heuristics and a data analysis application
- Breakout local search for maximum clique problems
- Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata
- NEW METAHEURISTIC APPROACHES FOR THE LEAF-CONSTRAINED MINIMUM SPANNING TREE PROBLEM
- scientific article; zbMATH DE number 1961993 (Why is no real title available?)
- An ant algorithm for the maximum number of 3-cliques in 3-partite graphs
- scientific article; zbMATH DE number 7295875 (Why is no real title available?)
- Solving maximum clique problem using chemical reaction optimization
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- Combining two pheromone structures for solving the car sequencing problem with ant colony optimization
This page was built for publication: A study of ACO capabilities 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 Q2491340)
