A scatter search algorithm for the maximum clique problem

MaRDI QIDQ2776559zbMATH OpenFDO

Authors Luís Cavique, César Rego, Isabel Themido

Publication date 28 February 2002

zbMATH Keywords

maximum clique problemscatter search algorithm

Mathematics Subject Classification ID

Search theory (90B40) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 6500694
• An adaptive multistart tabu search approach to solve the maximum clique problem
• On solving the maximum clique problem
• An algorithm for finding a maximum clique in a graph
• The maximum clique problem

Cited in

(7)

• An effective local search for the maximum clique problem
• Scatter search. Methodology and implementation in C. With CD-ROM.
• Subgraph extraction and metaheuristics for the maximum clique problem
• Scatter search for project scheduling with resource availability cost
• Advanced scatter search for the max-cut problem
• scientific article; zbMATH DE number 6500694 (Why is no real title available?)
• A heuristic for the stability number of a graph based on convex quadratic programming and tabu search

This page was built for publication: A scatter search algorithm for the maximum clique problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2776559)