An opposition-based memetic algorithm for the maximum quasi-clique problem
type: Item
instance of: scholarly article
title: An opposition-based memetic algorithm for the maximum quasi-clique problem
zbMATH Open document ID: 1443.90336
author: Qing Zhou
author: Una Benlic
author: Qinghua Wu
published in: European Journal of Operational Research
publication date: 2020-05-27T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7205720
zbMATH Keywords: heuristic
zbMATH Keywords: quasi-clique
zbMATH Keywords: opposition-based learning
zbMATH Keywords: constrained neighborhood
zbMATH Keywords: memetic algorithm
describes a project that uses: SNAP
describes a project that uses: SparseMatrix
describes a project that uses: Tabu search
describes a project that uses: irace
describes a project that uses: DIMACS
describes a project that uses: MCODE
MaRDI profile type: MaRDI publication profile
full work available at URL: j.ejor.2020.03.019
OpenAlex ID: W3012447874
cites work: Q4945528
cites work: Q3044359
cites work: Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
cites work: Dense subgraphs in random graphs
cites work: Experimental Methods for the Analysis of Optimization Algorithms
cites work: Breakout local search for maximum clique problems
cites work: Heuristics for finding \(k\)-clubs in an undirected graph
cites work: Clique-detection models in computational biochemistry and genomics
cites work: The university of Florida sparse matrix collection
cites work: Q3267900
cites work: Greedy and heuristic algorithms for codes and colorings
cites work: 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
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Q4245749
cites work: Partition-distance: A problem and class of perfect graphs arising in clustering
cites work: Q5687246
cites work: Reducibility among Combinatorial Problems
cites work: On the Computational Complexity of Combinatorial Problems
cites work: A tabu search based memetic algorithm for the Max-Mean dispersion problem
cites work: A Gentle Introduction to Memetic Algorithms
cites work: A branch-and-bound approach for maximum quasi-cliques
cites work: On maximum degree‐based ‐quasi‐clique problem: Complexity and exact approaches
cites work: On the maximum quasi-clique problem
cites work: On clique relaxation models in network analysis
cites work: A biased random-key genetic algorithm for the maximum quasi-clique problem
cites work: A search space ``cartography'' for guiding graph coloring heuristics
cites work: Landscapes, operators and heuristic search
cites work: An exact algorithm for the maximum quasi‐clique problem
cites work: A graph‐theoretic generalization of the clique concept
cites work: Iterated local search for the quadratic assignment problem
cites work: Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
cites work: An integer programming approach for finding the most and the least central cliques
cites work: An adaptive multistart tabu search approach to solve the maximum clique problem
cites work: Memetic search for the max-bisection problem
cites work: A memetic algorithm to pack unequal circles into a square
DOI: 10.1016/J.EJOR.2020.03.019
description: scientific article; zbMATH DE number 7205720