A quality and distance guided hybrid algorithm for the vertex separator problem

DOI10.1016/j.cor.2016.09.012zbMath1391.90515OpenAlexW2522848956MaRDI QIDQ1652081

Zhipeng Lü, Junwen Ding, Taoqing Zhou, Li-Ping Xu

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.09.012

zbMATH Keywords

diversification mechanismvertex separator problemdistance and quality guided tabu searchhybrid metaheuristic algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items

A three-phase matheuristic algorithm for the multi-day task assignment problem

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• A hybrid metaheuristic approach to solving the UBQP problem
• An exact algorithm for solving the vertex separator problem
• Finding good approximate vertex and edge partitions is NP-hard
• Variable neighborhood search
• Partitioning planar graphs with vertex costs: Algorithms and applications
• Greedy randomized adaptive search procedures
• The vertex separator problem: algorithms and computations
• The vertex separator problem: a polyhedral investigation
• Exact algorithms for the vertex separator problem in graphs
• A Separator Theorem for Planar Graphs
• Applications of a Planar Separator Theorem
• Parallel Algorithms for Sparse Linear Systems
• Tabu Search—Part I
• Finding Separator Cuts in Planar Graphs within Twice the Optimal
• A Spectral Bundle Method for Semidefinite Programming
• NP-completeness of the Planar Separator Problems