Combining intensification and diversification strategies in VNS. An application to the vertex separation problem

DOI10.1016/j.cor.2013.11.008zbMath1348.90606DBLPjournals/cor/Sanchez-OroPD14OpenAlexW1997205866WikidataQ57856018 ScholiaQ57856018MaRDI QIDQ337212

Juan José Pantrigo, Jesús Sánchez-Oro, Abraham Duarte

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.11.008

zbMATH Keywords

combinatorial optimizationvariable neighborhood searchlayout problemsdiversificationintensificationvertex separation problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (15)

Parallel variable neighborhood search for the min–max order batching problem ⋮ Global sensing search for nonlinear global optimization ⋮ Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies ⋮ General variable neighborhood search for computing graph separators ⋮ Polynomial time efficient construction heuristics for vertex separation minimization problem ⋮ GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem ⋮ General variable neighborhood search for the minimum stretch spanning tree problem ⋮ Partial neighborhood local searches ⋮ Population-based iterated greedy algorithm for the S-labeling problem ⋮ Variable neighborhood search approach with intensified shake for monitor placement ⋮ A variable neighborhood search approach for the vertex bisection problem ⋮ Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem ⋮ Two new integer linear programming formulations for the vertex bisection problem ⋮ Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth ⋮ A general variable neighborhood search for the cyclic antibandwidth problem

Cites Work

• Unnamed Item
• Unnamed Item
• Variable neighborhood search for the vertex separation problem
• Computing the vertex separation of unicyclic graphs
• On the parameterized complexity of layered graph drawing
• Variable neighbourhood search: methods and applications
• A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
• Antibandwidth and cyclic antibandwidth of meshes and hypercubes
• Interval graphs and searching
• Edge-isoperimetric inequalities in the grid
• The vertex separation number of a graph equals its path-width
• The vertex separation and search number of a graph
• On search, decision, and the efficiency of polynomial-time algorithms
• Variable neighborhood search
• GRASP and path relinking for the matrix bandwidth minimization.
• Scatter search for the cutwidth minimization problem
• Searching and pebbling
• An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
• GRASP with path relinking heuristics for the antibandwidth problem
• Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
• Treewidth and Pathwidth of Permutation Graphs

This page was built for publication: Combining intensification and diversification strategies in VNS. An application to the vertex separation problem