A biased random-key genetic algorithm for the maximum quasi-clique problem
type: Item
instance of: scholarly article
title: A biased random-key genetic algorithm for the maximum quasi-clique problem
zbMATH Open document ID: 1403.90644
author: Bruno Q. Pinto
author: Isabel Rosseti
author: Alexandre Plastino
author: Celso C. Ribeiro
published in: European Journal of Operational Research
publication date: 2018-08-03T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6913720
zbMATH Keywords: metaheuristics
zbMATH Keywords: biased random-key genetic algorithm
zbMATH Keywords: maximum quasi-clique problem
zbMATH Keywords: maximum clique problem
zbMATH Keywords: graph density
describes a project that uses: PERL
describes a project that uses: XPRESS
describes a project that uses: irace
describes a project that uses: BHOSLIB
describes a project that uses: TTTPLOTS
describes a project that uses: CPU Benchmarks
describes a project that uses: SparseMatrix
describes a project that uses: DIMACS
MaRDI profile type: MaRDI publication profile
full work available at URL: j.ejor.2018.05.071
OpenAlex ID: W2805404656
cites work: Q4945528
cites work: Q3044359
cites work: Probability distribution of solution time in GRASP: an experimental investigation
cites work: TTT plots: a perl program to create time-to-target plots
cites work: Genetic Algorithms and Random Keys for Sequencing and Optimization
cites work: A biased random-key genetic algorithm for single-round divisible load scheduling
cites work: A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems
cites work: Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
cites work: The University of Florida sparse matrix collection
cites work: A GRASP heuristic using path-relinking and restarts for the Steiner traveling salesman problem
cites work: Reducibility among combinatorial problems
cites work: On the maximum quasi-clique problem
cites work: Restart strategies for GRASP with path-relinking heuristics
cites work: Optimization by GRASP. Greedy randomized adaptive search procedures
cites work: A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
cites work: Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
Wikidata QID: Q129715140
DOI: 10.1016/J.EJOR.2018.05.071
Recommended article: A hybrid biased random key genetic algorithm for the quadratic assignment problem
Recommended article: An opposition-based memetic algorithm for the maximum quasi-clique problem
Recommended article: A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
Recommended article: Q4472034
Recommended article: A biased random-key genetic algorithm for data clustering
Recommended article: Improved genetic algorithm for maximum clique problem
Recommended article: Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
Recommended article: A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy
Recommended article: A biased random-key genetic algorithm for the tree of hubs location problem
description: scientific article; zbMATH DE number 6913720