An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems

DOI10.1016/j.endm.2012.10.009zbMath1268.90162OpenAlexW2058300431MaRDI QIDQ2840753

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)

Cites Work

• Variable neighborhood search for the vertex separation problem
• Black-white pebbles and graph separation
• Unnamed Item

This page was built for publication: An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems