A biased random-key genetic algorithm for the maximum quasi-clique problem

DOI10.1016/j.ejor.2018.05.071zbMath1403.90644OpenAlexW2805404656WikidataQ129715140 ScholiaQ129715140MaRDI QIDQ1653365

Bruno Q. Pinto, Isabel Rosseti, Alexandre Plastino, Celso Carneiro Ribeiro

Publication date: 3 August 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.05.071

zbMATH Keywords

metaheuristicsmaximum clique problemgraph densitybiased random-key genetic algorithmmaximum quasi-clique problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

An opposition-based memetic algorithm for the maximum quasi-clique problem ⋮ MIP formulations for induced graph optimization problems: a tutorial ⋮ A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains ⋮ A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem ⋮ Polarization reduction by minimum‐cardinality edge additions: Complexity and integer programming approaches ⋮ The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study ⋮ An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph ⋮ On the maximum small-world subgraph problem

Uses Software

• PERL
• SparseMatrix
• XPRESS
• TTTPLOTS
• irace
• BHOSLIB
• DIMACS
• CPU Benchmarks

Cites Work

• Unnamed Item
• Unnamed Item
• Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
• Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
• Restart strategies for GRASP with path-relinking heuristics
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• On the maximum quasi-clique problem
• Probability distribution of solution time in GRASP: an experimental investigation
• TTT plots: a perl program to create time-to-target plots
• A biased random-key genetic algorithm for single-round divisible load scheduling
• The university of Florida sparse matrix collection
• Optimization by GRASP
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• A GRASP heuristic using path‐relinking and restarts for the Steiner traveling salesman problem
• Reducibility among Combinatorial Problems
• A biased random‐key genetic algorithm for scheduling heterogeneous multi‐round systems

This page was built for publication: A biased random-key genetic algorithm for the maximum quasi-clique problem