scientific article; zbMATH DE number 2079894

MaRDI QIDQ4472034zbMATH OpenFDO

Authors Elena Marchiori

Publication date 3 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2279/22790112.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• A hybrid heuristic for the maximum clique problem
• Simple ingredients leading to very efficient heuristics for the maximum clique problem
• Improved genetic algorithm for maximum clique problem
• Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
• On comparing algorithms for the maximum clique problem

Cited in

(23)

• An adaptive multistart tabu search approach to solve the maximum clique problem
• Improved genetic algorithm for maximum clique problem
• A biased random-key genetic algorithm for the maximum quasi-clique problem
• Speeding up branch and bound algorithms for solving the maximum clique problem
• Mining relevant information on the Web: a clique-based approach
• A study of ACO capabilities for solving the maximum clique problem
• Phased local search for the maximum clique problem
• New heuristic approaches for maximum balanced biclique problem
• The generalized independent set problem: polyhedral analysis and solution approaches
• scientific article; zbMATH DE number 1961986 (Why is no real title available?)
• Genetic local search for the graph partitioning problem under cardinality constraints
• Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling
• Solving maximum clique problem using chemical reaction optimization
• Combinatorial algorithms for the maximum \(k\)-plex problem
• An effective local search for the maximum clique problem
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• Improvements to MCS algorithm for the maximum clique problem
• Learning to sample initial solution for solving 0-1 discrete optimization problem by local search
• Finding quasi core with simulated stacked neural networks
• Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
• Simple ingredients leading to very efficient heuristics for the maximum clique problem
• A hybrid heuristic for the maximum clique problem
• A review on algorithms for maximum clique problems

Describes a project that uses

Uses Software

• Genocop
• DIMACS

This page was built for publication:

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