A variable neighborhood search heuristic for the maximum ratio clique problem

DOI10.1016/j.cor.2017.01.010zbMath1391.90655OpenAlexW2582069059MaRDI QIDQ1652431

Dominik Goeke, Mahdi Moeini, David Poganiuch

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2017.01.010

zbMATH Keywords

heuristicmetaheuristicvariable neighborhood searchmaximal cliquemaximum ratio 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) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

On maximum ratio clique relaxations

Uses Software

• Algorithm 457

Cites Work

• A general VNS heuristic for the traveling salesman problem with time windows
• The maximum clique problem
• Variable neighborhood search
• Long-short portfolio optimization under cardinality constraints by difference of convex functions algorithm
• An integer programming approach for finding the most and the least central cliques
• The maximum ratio clique problem
• Variable neighbourhood search for bandwidth reduction
• On a continuous approach for the maximum weighted clique problem
• Mining market data: a network approach
• A review on algorithms for maximum clique problems
• A Complementary Pivoting Approach to the Maximum Weight Clique Problem
• Multi-Start Methods
• Parametric approaches to fractional programs
• A Novel Efficient Approach for Solving the Art Gallery Problem
• Reducibility among Combinatorial Problems
• The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results
• Algorithm 457: finding all cliques of an undirected graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item