Solving the multiobjective quasi-clique problem

DOI10.1016/J.EJOR.2024.12.018MaRDI QIDQ6981832zbMATH OpenFDO

Authors Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins, Luís Paquete

Publication date 20 May 2025

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

Full work available at URL https://doi.org/10.1016/J.EJOR.2024.12.018

zbMATH Keywords

combinatorial optimizationdensest k-subgraph problemmaximum quasi-clique problemmultiobjective quasi-clique problemmultiobjective subgraph problem

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35)

Cites work

• A biased random-key genetic algorithm for the maximum quasi-clique problem
• A branch-and-bound approach for maximum quasi-cliques
• A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy
• A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs
• Algorithms for the maximum weight connected k-induced subgraph problem
• An application of tabu search heuristic for the maximum edge-weighted subgraph problem
• An exact algorithm for the maximum quasi‐clique problem
• An opposition-based memetic algorithm for the maximum quasi-clique problem
• Bicriteria Transportation Problem
• Clustering and domination in perfect graphs
• Constrained optimization using multiple objective programming
• Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
• Different Formulations for Solving the HeaviestK-Subgraph Problem
• Exact algorithms for problems related to the densest \(k\)-set problem
• Exact and approximation algorithms for densest \(k\)-subgraph (extended abstract)
• Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
• Finding connected \(k\)-subgraphs with high density
• Finding dense subgraphs
• Greedily Finding a Dense Subgraph
• Handbook of combinatorial optimization. In 5 volumes
• scientific article; zbMATH DE number 2086259 (Why is no real title available?)
• scientific article; zbMATH DE number 1424314 (Why is no real title available?)
• LP-based dual bounds for the maximum quasi-clique problem
• Multicriteria Optimization
• Network Analysis
• Network science. With Márton Pósfai
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
• On the maximum quasi-clique problem
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• The dense \(k\)-subgraph problem
• The University of Florida sparse matrix collection
• Three-objective subgraph mining using multiobjective evolutionary programming

Cited in

(1)

• Ensuring connectedness for the maximum quasi-clique and densest k-subgraph problems

This page was built for publication: Solving the multiobjective quasi-clique problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6981832)