General variable neighborhood search for computing graph separators
type: Item
instance of: scholarly article
title: General variable neighborhood search for computing graph separators
zbMATH Open document ID: 1381.90074
author: Jesús Sánchez-Oro
author: Nenad Mladenović
author: Abraham Duarte
published in: Optimization Letters
publication date: 2017-11-10T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6805889
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: metaheuristics
zbMATH Keywords: VNS
zbMATH Keywords: graph separators
MaRDI profile type: Publication
full work available at URL: s11590-014-0793-z
OpenAlex ID: W2028260818
cites work: Expander flows, geometric embeddings and graph partitioning
cites work: A framework for solving VLSI graph layout problems
cites work: An exact algorithm for solving the vertex separator problem
cites work: Finding good approximate vertex and edge partitions is NP-hard
cites work: Variable neighborhood search for the vertex separation problem
cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
cites work: Improved approximation algorithms for minimum-weight vertex separators
cites work: Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem
cites work: Variable neighbourhood search: methods and applications
cites work: Variable neighborhood search
cites work: A Separator Theorem for Planar Graphs
cites work: Applications of a Planar Separator Theorem
cites work: A variable neighbourhood search approach to the cutwidth minimization problem
cites work: Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
cites work: The vertex separator problem: algorithms and computations
cites work: Variable Neighborhood Search
DOI: 10.1007/S11590-014-0793-Z
description: scientific article; zbMATH DE number 6805889