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