An experimental comparison of variable neighborhood search variants for the minimization of the vertex-cut in layout problems

DOI10.1016/J.ENDM.2012.10.009MaRDI QIDQ2840753zbMATH OpenOpenAlexFDO

Authors Jesús Sánchez-Oro, 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.009

zbMATH Keywords

profilemetaheuristicVNSvertex separation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Variable Neighborhood Search
• Developments of variable neighborhood search
• Enhanced meta-heuristics with variable neighborhood search strategy for combinatorial optimization problems
• Variable neighbourhood search: Methods and applications
• Variable neighborhood search: basics and variants

Cites work

• scientific article; zbMATH DE number 177539 (Why is no real title available?)
• Black-white pebbles and graph separation
• Variable neighborhood search for the vertex separation problem

Cited in

(4)

• Enhanced meta-heuristics with variable neighborhood search strategy for combinatorial optimization problems
• Parallel variable neighbourhood search strategies for the cutwidth minimization problem
• Variable neighborhood search for the vertex separation problem
• A variable neighbourhood search approach to the cutwidth minimization problem

This page was built for publication: An experimental comparison of variable neighborhood search variants for the minimization of the vertex-cut in layout problems

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