Variable neighborhood search for the vertex separation problem
From MaRDI portal
Publication:339678
DOI10.1016/J.COR.2012.04.017zbMATH Open1349.90809OpenAlexW1967700023WikidataQ57856250 ScholiaQ57856250MaRDI QIDQ339678FDOQ339678
Authors: Abraham Duarte, Rafael Martí, Nenad Mladenović, Juan J. Pantrigo, Jesús Sánchez-Oro, Laureano F. Escudero Bueno 
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.04.017
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
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Integer programming (90C10) Connectivity (05C40)
Cites Work
- Min Cut is NP-complete for edge weighted trees
- Searching and pebbling
- Variable neighborhood search
- A Separator Theorem for Planar Graphs
- Variable neighbourhood search: methods and applications
- On the parameterized complexity of layered graph drawing
- Edge-isoperimetric inequalities in the grid
- The vertex separation number of a graph equals its path-width
- On the pathwidth of chordal graphs
- The vertex separation and search number of a graph
- Obstruction set isolation for the gate matrix layout problem
- Treewidth and Pathwidth of Permutation Graphs
- GRASP and path relinking for the max-min diversity problem
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Computing the vertex separation of unicyclic graphs
- Pathwidth of cubic graphs and exact algorithms
- Black-white pebbles and graph separation
- Approximating layout problems on random geometric graphs
- Title not available (Why is that?)
- The pathwidth and treewidth of cographs
Cited In (22)
- Knowledge discovery in graphs through vertex separation
- A general variable neighborhood search for the cyclic antibandwidth problem
- 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
- 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
- Linear ordering based MIP formulations for the vertex separation or pathwidth problem
- Variable neighborhood descent applied to multi-way number partitioning 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
- General variable neighborhood search for computing graph separators
- Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth
- Variable neighborhood search for the maximum clique
- 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
- A variable neighborhood search approach for the vertex bisection problem
Uses Software
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)
