Subgraph extraction and metaheuristics for the maximum clique problem

DOI10.1007/S10732-012-9207-5zbMath1365.90277OpenAlexW2036313802MaRDI QIDQ2359135

Aziz Moukrim, Duc-Cuong Dang

Publication date: 27 June 2017

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

Full work available at URL: https://doi.org/10.1007/s10732-012-9207-5

zbMATH Keywords

metaheuristicsgenetic algorithmmaximum clique problemiterated local searchcircular-arc graphtriangulated graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Solving the team orienteering problem with cutting planes ⋮ Performance evaluation of a parallel ant colony optimization for the real-time train routing selection problem in large instances ⋮ Hybridizations of evolutionary algorithms with large neighborhood search ⋮ The clustered team orienteering problem

Uses Software

• QUALEX
• BHOSLIB
• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Variable neighborhood search for the maximum clique
• An exact algorithm for the maximum clique problem
• Simple ingredients leading to very efficient heuristics for the maximum clique problem
• Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers
• An effective local search for the maximum clique problem
• Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
• Test case generators and computational results for the maximum clique problem
• The maximum clique problem
• Algorithmic graph theory and perfect graphs
• Phased local search for the maximum clique problem
• A new trust region technique for the maximum weight clique problem
• A hybrid heuristic for the maximum clique problem
• A study of ACO capabilities for solving the maximum clique problem
• Finding a Maximum Clique in an Arbitrary Graph
• Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem
• AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs
• Error Detecting and Error Correcting Codes
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Reactive local search for the maximum clique problem

This page was built for publication: Subgraph extraction and metaheuristics for the maximum clique problem