Analysis of reactive search optimisation techniques for the maximum clique problem and applications. (Summary)

DOI10.1007/S10288-011-0176-6zbMATH Open1263.90078OpenAlexW2053707335MaRDI QIDQ1936664FDOQ1936664

Franco Mascia

Publication date: 6 February 2013

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-011-0176-6

zbMATH Keywords

dynamic local searchreactive local searchalgorithmic components

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cited In (1)

• A study of ACO capabilities for solving the maximum clique problem

   Recommendations

• Reactive local search for the maximum clique problem 👍 👎
• Reactive and dynamic local search for max-clique: engineering effective building blocks 👍 👎
• Title not available (Why is that?) 👍 👎
• An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments 👍 👎
• A review on algorithms for maximum clique problems 👍 👎
• Title not available (Why is that?) 👍 👎
• Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications 👍 👎
• An effective local search for the maximum clique problem 👍 👎
• A New Approach for Solving the Maximum Clique Problem 👍 👎

This page was built for publication: Analysis of reactive search optimisation techniques for the maximum clique problem and applications. (Summary)

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