A policy-based learning beam search for combinatorial optimization

DOI10.1007/978-3-031-30035-6_9MaRDI QIDQ6149097FDOQ6149097

Authors: Rupert Ettrich, Marc Huber, Günther R. Raidl 

Publication date: 12 January 2024

Published in: Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

machine learningreinforcement learninglongest common subsequence problembeam search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Combinatorial optimization (90C27)

Cites Work

• Algorithms on Strings, Trees and Sequences
• Reinforcement learning. An introduction
• The Complexity of Some Problems on Subsequences and Supersequences
• Finding the longest common subsequence for multiple biological sequences by ant colony optimization
• A large neighborhood search heuristic for the longest common subsequence problem
• A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play

This page was built for publication: A policy-based learning beam search for combinatorial optimization

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