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

DOI10.1016/J.ENDM.2012.10.009zbMATH Open1268.90162OpenAlexW2058300431MaRDI QIDQ2840753FDOQ2840753

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

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

zbMATH Keywords

profilemetaheuristicVNSvertex separation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Variable neighborhood search for the vertex separation problem
• Black-white pebbles and graph separation
• Title not available (Why is that?)

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)