Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
DOI10.1016/J.COR.2013.11.008zbMATH Open1348.90606DBLPjournals/cor/Sanchez-OroPD14OpenAlexW1997205866WikidataQ57856018 ScholiaQ57856018MaRDI QIDQ337212FDOQ337212
Authors: Jesús Sánchez-Oro, Juan J. Pantrigo, 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
Recommendations
- Variable neighborhood search for the vertex separation problem
- A decomposition strategy for the vertex cover problem
- The vertex separator problem: a polyhedral investigation
- The vertex separator problem: algorithms and computations
- A multilevel bilinear programming algorithm for the vertex separator problem
- A variable neighborhood search approach for the vertex bisection problem
- VNS variants for the Max-Mean dispersion problem
- Diversification strategies in tabu search algorithms for the maximum clique problem
- A quality and distance guided hybrid algorithm for the vertex separator problem
- Minimization and parameterized variants of vertex partition problems on graphs
combinatorial optimizationvariable neighborhood searchdiversificationintensificationlayout problemsvertex separation problem
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- Searching and pebbling
- Variable neighborhood search
- Variable neighbourhood search: methods and applications
- On the parameterized complexity of layered graph drawing
- Edge-isoperimetric inequalities in the grid
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- The vertex separation number of a graph equals its path-width
- The vertex separation and search number of a graph
- Treewidth and Pathwidth of Permutation Graphs
- GRASP and path relinking for the matrix bandwidth minimization.
- GRASP with path relinking heuristics for the antibandwidth problem
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- Interval graphs and searching
- On search, decision, and the efficiency of polynomial-time algorithms
- Scatter search for the cutwidth minimization problem
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
- Title not available (Why is that?)
- Variable neighborhood search for the vertex separation problem
- Title not available (Why is that?)
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Computing the vertex separation of unicyclic graphs
Cited In (20)
- General variable neighborhood search for the minimum stretch spanning tree problem
- A general variable neighborhood search for the cyclic antibandwidth problem
- Global sensing search for nonlinear global optimization
- Population-based iterated greedy algorithm for the S-labeling problem
- A hybrid breakout local search and reinforcement learning approach to the vertex separator problem
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
- Variable neighborhood search approach with intensified shake for monitor placement
- A variable neighborhood search for the median location problem with interconnected facilities
- Parallel variable neighborhood search for the min-max order batching problem
- Partial neighborhood local searches
- Variable neighborhood search for the vertex separation problem
- General variable neighborhood search for computing graph separators
- Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth
- GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem
- Two new integer linear programming formulations for the vertex bisection problem
- Exploiting separators for guiding VNS
- A quality and distance guided hybrid algorithm for the vertex separator problem
- Polynomial time efficient construction heuristics for vertex separation minimization problem
- Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies
- A variable neighborhood search approach for the vertex bisection problem
This page was built for publication: Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337212)
