A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem

DOI10.1016/j.endm.2012.10.010zbMath1268.90159OpenAlexW2069987930WikidataQ57856176 ScholiaQ57856176MaRDI QIDQ2840754

Juan José Pantrigo, Abraham Duarte, Nenad Mladenović, Eduardo G. Pardo

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2012.10.010

zbMATH Keywords

variable neighbourhood searchcutwidth minimization problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

General variable neighborhood search for computing graph separators ⋮ A general variable neighborhood search approach for the minimum load coloring problem ⋮ Population-based iterated greedy algorithm for the S-labeling problem ⋮ Packing a fixed number of identical circles in a circular container with circular prohibited areas

Cites Work

• Variable neighbourhood search: methods and applications
• Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
• Variable neighborhood search
• Parallel algorithms for the minimum cut and the minimum length tree layout problems
• A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
• Cutwidth II: Algorithms for partial w-trees of bounded degree
• Optimal numberings and isoperimetric problems on graphs

This page was built for publication: A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem