General variable neighborhood search for computing graph separators

DOI10.1007/S11590-014-0793-ZzbMATH Open1381.90074OpenAlexW2028260818MaRDI QIDQ1677293FDOQ1677293

Authors: Jesús Sánchez-Oro, Nenad Mladenović, Abraham Duarte 

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

Recommendations

• Variable neighborhood search for the vertex separation problem
• A variable neighborhood search approach for the vertex bisection problem
• A Heuristic Algorithm for Small Separators in Arbitrary Graphs
• Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
• An exact algorithm for solving the vertex separator problem

zbMATH Keywords

combinatorial optimizationmetaheuristicsVNSgraph separators

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Applications of a Planar Separator Theorem
• Finding good approximate vertex and edge partitions is NP-hard
• Variable neighborhood search
• A Separator Theorem for Planar Graphs
• Variable neighbourhood search: methods and applications
• Variable Neighborhood Search
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
• The vertex separator problem: algorithms and computations
• Expander flows, geometric embeddings and graph partitioning
• A framework for solving VLSI graph layout problems
• Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
• Variable neighborhood search for the vertex separation problem
• Improved approximation algorithms for minimum-weight vertex separators
• Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem
• An exact algorithm for solving the vertex separator problem
• A variable neighbourhood search approach to the cutwidth minimization problem

Cited In (4)

• Title not available (Why is that?)
• Variable neighborhood search for the single machine scheduling problem to minimize the total early work
• Arbitrary-norm hyperplane separation by variable neighbourhood search
• A variable neighborhood search approach for the vertex bisection problem

This page was built for publication: General variable neighborhood search for computing graph separators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1677293)