An opposition-based memetic algorithm for the maximum quasi-clique problem
From MaRDI portal
Publication:2184091
Recommendations
- On the maximum quasi-clique problem
- A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- A biased random-key genetic algorithm for the maximum quasi-clique problem
- A branch-and-bound approach for maximum quasi-cliques
Cites work
- scientific article; zbMATH DE number 2086259 (Why is no real title available?)
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 1297592 (Why is no real title available?)
- scientific article; zbMATH DE number 1424314 (Why is no real title available?)
- scientific article; zbMATH DE number 956839 (Why is no real title available?)
- A Gentle Introduction to Memetic Algorithms
- A biased random-key genetic algorithm for the maximum quasi-clique problem
- A branch-and-bound approach for maximum quasi-cliques
- A graph‐theoretic generalization of the clique concept
- A memetic algorithm to pack unequal circles into a square
- A search space ``cartography for guiding graph coloring heuristics
- A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
- A tabu search based memetic algorithm for the Max-Mean dispersion problem
- An adaptive multistart tabu search approach to solve the maximum clique problem
- An exact algorithm for the maximum quasi‐clique problem
- An integer programming approach for finding the most and the least central cliques
- Breakout local search for maximum clique problems
- Clique relaxations in social network analysis: the maximum \(k\)-plex problem
- Clique-detection models in computational biochemistry and genomics
- Dense subgraphs in random graphs
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- Experimental Methods for the Analysis of Optimization Algorithms
- Greedy and heuristic algorithms for codes and colorings
- Heuristics for finding \(k\)-clubs in an undirected graph
- Iterated local search for the quadratic assignment problem
- Landscapes, operators and heuristic search
- Memetic search for the max-bisection problem
- On clique relaxation models in network analysis
- On maximum degree-based \(\gamma\)-quasi-clique problem: complexity and exact approaches
- On the Computational Complexity of Combinatorial Problems
- On the maximum quasi-clique problem
- Partition-distance: A problem and class of perfect graphs arising in clustering
- Reducibility among combinatorial problems
- Tabu Search—Part I
- Tabu Search—Part II
- The University of Florida sparse matrix collection
Cited in
(8)- A biased random-key genetic algorithm for the maximum quasi-clique problem
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network
- On finding the community with maximum persistence probability
- Learning driven three-phase search for the maximum independent union of cliques problem
- MIP formulations for induced graph optimization problems: a tutorial
- A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy
- Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
- The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study
This page was built for publication: An opposition-based memetic algorithm for the maximum quasi-clique problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2184091)
