Skip to Main content Skip to Navigation
Journal articles

Variable neighborhood search for minimum linear arrangement problem

Abstract : This paper presents a general variable neighborhood search (GVNS) heuristic for solving the maximum diverse grouping problem. Extensive computational experiments performed on a series of large random graphs as well as on several instances of the maximum diversity problem taken from the literature show that the results obtained by GVNS consistently outperform the best heuristics from the literature.
Document type :
Journal articles
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03578687
Contributor : Julie Cagniard Connect in order to contact the contributor
Submitted on : Thursday, February 17, 2022 - 2:23:57 PM
Last modification on : Tuesday, May 17, 2022 - 11:58:27 AM

Links full text

Identifiers

Collections

Citation

Nenad Mladenovic, Dragan Urošević, Dionisio Pérez-Brit. Variable neighborhood search for minimum linear arrangement problem. Yugoslav Journal of Operations Research, University of Belgrade, 2016, 26 (1), pp.3-14. ⟨10.2298/YJOR140928038M⟩. ⟨hal-03578687⟩

Share

Metrics

Record views

11