Finding good approximate vertex and edge partitions is NP-hard
Information Processing Letters
Hashing vectors for tabu search
Annals of Operations Research - Special issue on Tabu search
A Spectral Bundle Method for Semidefinite Programming
SIAM Journal on Optimization
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
The vertex separator problem: algorithms and computations
Mathematical Programming: Series A and B
The vertex separator problem: a polyhedral investigation
Mathematical Programming: Series A and B
An exact algorithm for solving the vertex separator problem
Journal of Global Optimization
A Multilevel Memetic Approach for Improving Graph k-Partitions
IEEE Transactions on Evolutionary Computation
Breakout Local Search for maximum clique problems
Computers and Operations Research
A study of breakout local search for the minimum sum coloring problem
SEAL'12 Proceedings of the 9th international conference on Simulated Evolution and Learning
Breakout Local Search for the Max-Cutproblem
Engineering Applications of Artificial Intelligence
| Hi-index | 0.00 |
In this paper, we propose the first heuristic approach for the vertex separator problem (VSP), based on Breakout Local Search (BLS). BLS is a recent meta-heuristic that follows the general framework of the popular Iterated Local Search (ILS) with a particular focus on the perturbation strategy. Based on some relevant information on search history, it tries to introduce the most suitable degree of diversification by determining adaptively the number and type of moves for the next perturbation phase. The proposed heuristic is highly competitive with the exact state-of-art approaches from the literature on the current VSP benchmark. Moreover, we present for the first time computational results for a set of large graphs with up to 3000 vertices, which constitutes a new challenging benchmark for VSP approaches.