A policy-based learning beam search for combinatorial optimization

DOI10.1007/978-3-031-30035-6_9MaRDI QIDQ6149097zbMATH OpenFDO

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)

Full work available at URL https://doi.org/10.1007/978-3-031-30035-6_9

zbMATH Keywords

beam searchlongest common subsequence problemmachine learningreinforcement learning

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(1)

• Generic machine-learning-augmented beam search for resource-constrained shortest path reformulations of combinatorial optimization problems

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)