An opposition-based memetic algorithm for the maximum quasi-clique problem
From MaRDI portal
Publication:2184091
DOI10.1016/J.EJOR.2020.03.019zbMATH Open1443.90336OpenAlexW3012447874MaRDI QIDQ2184091FDOQ2184091
Authors: Qing Zhou, Una Benlic, Qinghua Wu 
Publication date: 27 May 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.03.019
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
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- The University of Florida sparse matrix collection
- Title not available (Why is that?)
- Reducibility among combinatorial problems
- Tabu Search—Part I
- 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
- On the maximum quasi-clique problem
- On clique relaxation models in network analysis
- An integer programming approach for finding the most and the least central cliques
- Clique-detection models in computational biochemistry and genomics
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- Clique relaxations in social network analysis: the maximum \(k\)-plex problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- A branch-and-bound approach for maximum quasi-cliques
- A search space ``cartography for guiding graph coloring heuristics
- A graph‐theoretic generalization of the clique concept
- A Gentle Introduction to Memetic Algorithms
- Iterated local search for the quadratic assignment problem
- Experimental Methods for the Analysis of Optimization Algorithms
- Tabu Search—Part II
- On the Computational Complexity of Combinatorial Problems
- Partition-distance: A problem and class of perfect graphs arising in clustering
- An adaptive multistart tabu search approach to solve the maximum clique problem
- Landscapes, operators and heuristic search
- Heuristics for finding \(k\)-clubs in an undirected graph
- Memetic search for the max-bisection problem
- Breakout local search for maximum clique problems
- A tabu search based memetic algorithm for the Max-Mean dispersion problem
- Title not available (Why is that?)
- Dense subgraphs in random graphs
- Greedy and heuristic algorithms for codes and colorings
- Title not available (Why is that?)
- A biased random-key genetic algorithm for the maximum quasi-clique problem
- A memetic algorithm to pack unequal circles into a square
- An exact algorithm for the maximum quasi‐clique problem
- On maximum degree-based \(\gamma\)-quasi-clique problem: complexity and exact approaches
Cited In (8)
- A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy
- A biased random-key genetic algorithm for the maximum quasi-clique problem
- MIP formulations for induced graph optimization problems: a tutorial
- Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network
- On finding the community with maximum persistence probability
- The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study
- Learning driven three-phase search for the maximum independent union of cliques problem
Uses Software
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)
