Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/14813
Title: Variable neighborhood search for the heaviest k-subgraph
Authors: Brimberg, J
Mladenovic, N
Urosevic, D
Ngai, E 
Keywords: Combinatorial optimization
Heaviest k-subgraph
Maximum diversity
Metaheuristics
Variable neighborhood search
Issue Date: 2009
Publisher: Pergamon Press
Source: Computers and operations research, 2009, v. 36, no. 11, p. 2885-2891 How to cite?
Journal: Computers and operations research 
Abstract: 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.
URI: http://hdl.handle.net/10397/14813
ISSN: 0305-0548
EISSN: 1873-765X
DOI: 10.1016/j.cor.2008.12.020
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

22
Last Week
1
Last month
0
Citations as of Oct 15, 2017

WEB OF SCIENCETM
Citations

18
Last Week
0
Last month
0
Citations as of Oct 13, 2017

Page view(s)

58
Last Week
1
Last month
Checked on Oct 16, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.