Variable neighborhood search for the vertex separation problem
From MaRDI portal
(Redirected from Publication:339678)
Recommendations
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
- A variable neighborhood search approach for the vertex bisection problem
- Polynomial time efficient construction heuristics for vertex separation minimization problem
- An experimental comparison of variable neighborhood search variants for the minimization of the vertex-cut in layout problems
- General variable neighborhood search for computing graph separators
Cites work
- scientific article; zbMATH DE number 1670677 (Why is no real title available?)
- scientific article; zbMATH DE number 1222842 (Why is no real title available?)
- scientific article; zbMATH DE number 1303600 (Why is no real title available?)
- A Separator Theorem for Planar Graphs
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Approximating layout problems on random geometric graphs
- Black-white pebbles and graph separation
- Computing the vertex separation of unicyclic graphs
- Edge-isoperimetric inequalities in the grid
- GRASP and path relinking for the max-min diversity problem
- GRASP with path relinking heuristics for the antibandwidth problem
- Interval graphs and searching
- Min Cut is NP-complete for edge weighted trees
- Obstruction set isolation for the gate matrix layout problem
- On search, decision, and the efficiency of polynomial-time algorithms
- On the parameterized complexity of layered graph drawing
- On the pathwidth of chordal graphs
- Pathwidth of cubic graphs and exact algorithms
- Scatter search for the cutwidth minimization problem
- Searching and pebbling
- The pathwidth and treewidth of cographs
- 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 neighbourhood search: methods and applications
Cited in
(22)- A variable neighborhood search approach for the vertex bisection problem
- Knowledge discovery in graphs through vertex separation
- A general variable neighborhood search for the cyclic antibandwidth problem
- 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
- On integer linear programs for treewidth based on perfect elimination orderings
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems
- Parallel variable neighborhood search for the min-max order batching problem
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
- Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
- Variable neighborhood descent applied to multi-way number partitioning problem
- Linear ordering based MIP formulations for the vertex separation or pathwidth problem
- General variable neighborhood search for computing graph separators
- Variable neighborhood search for the maximum clique
- Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth
- An experimental comparison of variable neighborhood search variants for the minimization of the vertex-cut in layout problems
- A quality and distance guided hybrid algorithm for the vertex separator problem
- Polynomial time efficient construction heuristics for vertex separation minimization problem
- Variable neighbourhood search for the minimum labelling Steiner tree problem
- Approaching the rank aggregation problem by local search-based metaheuristics
- Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies
This page was built for publication: Variable neighborhood search for the vertex separation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339678)
