A study of ACO capabilities for solving the maximum clique problem

DOI10.1007/s10732-006-4295-8zbMath1163.90817OpenAlexW2078732543MaRDI QIDQ2491340

Christine Solnon, Serge Fenet

Publication date: 29 May 2006

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-006-4295-8

zbMATH Keywords

Ant colony optimizationMetaheuristicMaximum clique problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Subgraph extraction and metaheuristics for the maximum clique problem, Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata, A review on algorithms for maximum clique problems, Breakout local search for maximum clique problems, Solving maximum clique problem using chemical reaction optimization, A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators, NEW METAHEURISTIC APPROACHES FOR THE LEAF-CONSTRAINED MINIMUM SPANNING TREE PROBLEM, 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, An ant colony optimization approach for the multidimensional knapsack problem, Maximum cut-clique problem: ILS heuristics and a data analysis application, Simple ingredients leading to very efficient heuristics for the maximum clique problem

Uses Software

• MACS-VRPTW
• Tabu search
• HAS-QAP

Cites Work

• Approximation algorithms for combinatorial problems
• STABULUS: A technique for finding stable sets in large graphs with tabu search
• An improved ant system algorithm for the vehicle routing problem
• Solving the maximum clique problem using a tabu search approach
• Ant colonies for the quadratic assignment problem
• Bandwidth Packing: A Tabu Search Approach
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• Evolutionary Computation in Combinatorial Optimization
• Reactive local search for the maximum clique problem
• Adaptive, restart, randomized greedy heuristics for maximum clique
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item