A variable neighborhood search heuristic for the maximum ratio clique problem
type: Item
instance of: scholarly article
title: A variable neighborhood search heuristic for the maximum ratio clique problem
zbMATH Open document ID: 1391.90655
author: Dominik Goeke
author: Mahdi Moeini
author: David Poganiuch
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6901493
zbMATH Keywords: variable neighborhood search
zbMATH Keywords: heuristic
zbMATH Keywords: metaheuristic
zbMATH Keywords: maximum ratio clique problem
zbMATH Keywords: maximal clique
describes a project that uses: Algorithm 457
MaRDI profile type: Publication
full work available at URL: j.cor.2017.01.010
OpenAlex ID: W2582069059
cites work: Q4945528
cites work: Mining market data: a network approach
cites work: Q3145799
cites work: Algorithm 457: finding all cliques of an undirected graph
cites work: A general VNS heuristic for the traveling salesman problem with time windows
cites work: On a continuous approach for the maximum weighted clique problem
cites work: Q4434988
cites work: Parametric approaches to fractional programs
cites work: Q5734003
cites work: Reducibility among Combinatorial Problems
cites work: A Novel Efficient Approach for Solving the Art Gallery Problem
cites work: Q3048571
cites work: Long-short portfolio optimization under cardinality constraints by difference of convex functions algorithm
cites work: Multi-Start Methods
cites work: A complementary pivoting approach to the maximum weight clique problem
cites work: Variable neighborhood search
cites work: Variable neighbourhood search for bandwidth reduction
cites work: The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results
cites work: The maximum clique problem
cites work: The maximum ratio clique problem
cites work: An integer programming approach for finding the most and the least central cliques
cites work: A review on algorithms for maximum clique problems
DOI: 10.1016/J.COR.2017.01.010
Recommended article: Variable neighborhood search for the maximum clique
Recommended article: A hybrid heuristic for the maximum clique problem
Recommended article: The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results
Recommended article: Multi-neighborhood tabu search for the maximum weight clique problem
Recommended article: Q5687252
Recommended article: An effective local search for the maximum clique problem
Recommended article: Q4527182
Recommended article: A pivoting-based heuristic for the maximum clique problem.
Recommended article: Q3623999
description: scientific article; zbMATH DE number 6901493