Good solutions to discrete noxious location problems via metaheuristics
Annals of Operations Research - Special issue on locational decisions
Computers and Operations Research
Finding Dense Subgraphs with Semidefinite Programming
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
First vs. best improvement: an empirical study
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
New heuristics for the maximum diversity problem
Journal of Heuristics
Hybrid heuristics for the maximum diversity problem
Computational Optimization and Applications
Heuristics and metaheuristics for the maximum diversity problem
Journal of Heuristics
A tabu search based memetic algorithm for the maximum diversity problem
Engineering Applications of Artificial Intelligence
Hi-index | 0.01 |
This paper presents a variable neighborhood search (VNS) heuristic for solving the heaviest k-subgraph problem. Different versions of the heuristic are examined including 'skewed' VNS and a combination of a constructive heuristic followed by VNS. Extensive computational experiments are performed on a series of large random graphs as well as several instances of the related maximum diversity problem taken from the literature. The results obtained by VNS were consistently the best over a number of other heuristics tested.