A hybrid breakout local search and reinforcement learning approach to the vertex separator problem

DOI10.1016/j.ejor.2017.01.023zbMath1403.90631OpenAlexW2581631698MaRDI QIDQ1753627

Una Benlic, Michael G. Epitropakis, Edmund Kieran Burke

Publication date: 29 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2017.01.023

zbMATH Keywords

heuristicsreinforcement learningvertex separatoriterated local searchparameter control

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Learning and adaptive systems in artificial intelligence (68T05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Alternative evaluation functions for the cyclic bandwidth sum problem ⋮ A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment ⋮ Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art ⋮ Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Breakout local search for maximum clique problems
• An exact algorithm for solving the vertex separator problem
• A framework for solving VLSI graph layout problems
• Parameter setting in evolutionary algorithms.
• Reactive search and intelligent optimization
• Finding good approximate vertex and edge partitions is NP-hard
• Breakout local search for the quadratic assignment problem
• The vertex separator problem: algorithms and computations
• The vertex separator problem: a polyhedral investigation
• Continuous quadratic programming formulations of optimization problems on graphs
• Partitioning Hypergraphs in Scientific Computing Applications through Vertex Separators on Graphs
• Finding small balanced separators
• Exact algorithms for the vertex separator problem in graphs
• Statistical mechanics of complex networks
• Improved approximation algorithms for minimum-weight vertex separators
• A Separator Theorem for Planar Graphs
• An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
• A graph partitioning algorithm by node separators
• A Spectral Bundle Method for Semidefinite Programming
• Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem
• Some aspects of the sequential design of experiments
• Finite-time analysis of the multiarmed bandit problem

This page was built for publication: A hybrid breakout local search and reinforcement learning approach to the vertex separator problem