Authors: Pardo, Eduardo
Mladenović, Nenad 
Pantrigo, Juan
Duarte, Abraham
Title: A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem
Journal: Electronic Notes in Discrete Mathematics
Volume: 39
First page: 67
Last page: 74
Issue Date: 1-Dec-2012
DOI: 10.1016/j.endm.2012.10.010
The Cutwidth Minimization Problem, also known as the Minimum Cut Linear Arrangement consists of finding an arrangement of the vertices of a graph on a line, in such a way that the maximum number of edges between each pair of consecutive vertices is minimized. This problem has practical applications in VLSI Design, Network Migration and Graph Drawing, among others. In this paper we propose several heuristics based on the Variable Neighbourhood Search methodology to tackle the problem and we compare them with other state-of-the-art methods.
Keywords: Cutwidth Minimization Problem | Variable Neighbourhood Search
Publisher: Elsevier

Show full item record


checked on Jun 13, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




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