Variable neighborhood search for the heaviest \(k\)-subgraph
type: Item
instance of: scholarly article
title: Variable neighborhood search for the heaviest \(k\)-subgraph
zbMATH Open document ID: 1162.90540
author: Jack Brimberg
author: Dragan Urošević
author: Nenad Mladenović
author: Eric W. T. Ngai
published in: Computers \& Operations Research
publication date: 2009-06-18T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 5566380
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: heaviest \(k\)-subgraph
zbMATH Keywords: maximum diversity
zbMATH Keywords: metaheuristics
zbMATH Keywords: variable neighborhood search
MaRDI profile type: MaRDI publication profile
full work available at URL: j.cor.2008.12.020
OpenAlex ID: W2067583942
cites work: Clustering and domination in perfect graphs
cites work: Different Formulations for Solving the HeaviestK-Subgraph Problem
cites work: Q4400856
cites work: Good solutions to discrete noxious location problems via metaheuristics
cites work: The discrete p-dispersion problem
cites work: Tabu search and GRASP for the maximum diversity problem
cites work: An application of tabu search heuristic for the maximum edge-weighted subgraph problem
cites work: A deterministic approximation algorithm for the densest \(k\)-subgraph problem
cites work: Hybrid heuristics for the maximum diversity problem
cites work: Iterated tabu search for the maximum diversity problem
cites work: Variable Neighborhood Search
cites work: Variable neighborhood search
cites work: First vs. best improvement: an empirical study
cites work: Tabu search versus GRASP for the maximum diversity problem
cites work: Computational aspects of the maximum diversity problem
cites work: Obtaining test problems via Internet
DOI: 10.1016/J.COR.2008.12.020
description: scientific article; zbMATH DE number 5566380