Reinforcement learning-based heuristics to guide domain-independent dynamic programming

DOI10.1007/978-3-031-95976-9_9MaRDI QIDQ6897976zbMATH OpenFDO

Authors Minori Narita, Ryo Kuroiwa, J. Christopher Beck

Publication date 19 November 2025

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

zbMATH Keywords

combinatorial optimizationdynamic programmingreinforcement learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27) Dynamic programming (90C39)

Cites work

• Deep policy dynamic programming for vehicle routing problems
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 4154239 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• Polymatroids and mean-risk minimization in discrete optimization
• The traveling-salesman problem

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: Reinforcement learning-based heuristics to guide domain-independent dynamic programming

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