A hybrid breakout local search and reinforcement learning approach to the vertex separator problem
DOI10.1016/J.EJOR.2017.01.023zbMATH Open1403.90631OpenAlexW2581631698MaRDI QIDQ1753627FDOQ1753627
Una Benlic, Edmund K. Burke, Michael G. Epitropakis
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
Learning and adaptive systems in artificial intelligence (68T05) Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Statistical mechanics of complex networks
- 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
- 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
- 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 (5)
- 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
- 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)
