Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
From MaRDI portal
(Redirected from Publication:337212)
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
Cites work
- scientific article; zbMATH DE number 1670677 (Why is no real title available?)
- scientific article; zbMATH DE number 1303600 (Why is no real title available?)
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Computing the vertex separation of unicyclic graphs
- Edge-isoperimetric inequalities in the grid
- GRASP and path relinking for the matrix bandwidth minimization.
- GRASP with path relinking heuristics for the antibandwidth problem
- Interval graphs and searching
- On search, decision, and the efficiency of polynomial-time algorithms
- On the parameterized complexity of layered graph drawing
- Scatter search for the cutwidth minimization problem
- Searching and pebbling
- The vertex separation and search number of a graph
- The vertex separation number of a graph equals its path-width
- Treewidth and Pathwidth of Permutation Graphs
- Variable neighborhood search
- Variable neighborhood search for the vertex separation problem
- Variable neighbourhood search: methods and applications
Cited in
(20)- A variable neighborhood search approach for the vertex bisection problem
- A general variable neighborhood search for the cyclic antibandwidth problem
- General variable neighborhood search for the minimum stretch spanning tree problem
- Global sensing search for nonlinear global optimization
- A hybrid breakout local search and reinforcement learning approach to the vertex separator problem
- Population-based iterated greedy algorithm for the S-labeling 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
- Variable neighborhood search for the vertex separation problem
- Partial neighborhood local searches
- General variable neighborhood search for computing graph separators
- GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center 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
- 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
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)
