A variable neighbourhood search approach to the cutwidth minimization problem

DOI10.1016/J.ENDM.2012.10.010MaRDI QIDQ2840754zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Eduardo G. Pardo, Nenad Mladenović, Juan J. Pantrigo, Abraham Duarte

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)

Recommendations

• Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
• Branch and bound for the cutwidth minimization problem
• Scatter search for the cutwidth minimization problem
• An experimental comparison of variable neighborhood search variants for the minimization of the vertex-cut in layout problems
• Parallel variable neighbourhood search strategies for the cutwidth minimization problem

Cites work

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

Cited in

(9)

• Packing a fixed number of identical circles in a circular container with circular prohibited areas
• Multistart search for the cyclic cutwidth minimization problem
• A general variable neighborhood search approach for the minimum load coloring problem
• Population-based iterated greedy algorithm for the S-labeling problem
• Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
• A variable neighborhood search and simulated annealing hybrid for the profile minimization problem
• Branch and bound for the cutwidth minimization problem
• General variable neighborhood search for computing graph separators
• Scatter search for the cutwidth minimization problem

This page was built for publication: A variable neighbourhood search approach to the cutwidth minimization problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840754)