General variable neighborhood search for computing graph separators
From MaRDI portal
Publication:1677293
DOI10.1007/s11590-014-0793-zzbMath1381.90074OpenAlexW2028260818MaRDI QIDQ1677293
Nenad Mladenović, Abraham Duarte, Jesús Sánchez-Oro
Publication date: 10 November 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-014-0793-z
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
Variable neighborhood search for the single machine scheduling problem to minimize the total early work ⋮ A variable neighborhood search approach for the vertex bisection problem
Cites Work
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
- Variable neighborhood search for the vertex separation problem
- An exact algorithm for solving the vertex separator problem
- A framework for solving VLSI graph layout problems
- Variable neighbourhood search: methods and applications
- Finding good approximate vertex and edge partitions is NP-hard
- Variable neighborhood search
- The vertex separator problem: algorithms and computations
- A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Improved approximation algorithms for minimum-weight vertex separators
- A Separator Theorem for Planar Graphs
- Applications of a Planar Separator Theorem
- Variable Neighborhood Search
- Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem
- Expander flows, geometric embeddings and graph partitioning
This page was built for publication: General variable neighborhood search for computing graph separators
