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

DOI10.1016/J.EJOR.2017.01.023zbMATH Open1403.90631OpenAlexW2581631698MaRDI QIDQ1753627FDOQ1753627

Authors: Una Benlic, Michael G. Epitropakis, Edmund K. 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

Recommendations

• Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
• Variable neighborhood search for the vertex separation problem
• A quality and distance guided hybrid algorithm for the vertex separator problem
• Exact algorithms for the vertex separator problem in graphs
• A variable neighborhood search approach for the vertex bisection problem

zbMATH Keywords

heuristicsiterated local searchreinforcement learningvertex separatorparameter control

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Alternative evaluation functions for the cyclic bandwidth sum problem
• Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
• A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment
• A quality and distance guided hybrid algorithm for the vertex separator problem
• Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
• Learning driven three-phase search for the maximum independent union of cliques problem

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

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