Parallelization strategies for rollout algorithms
From MaRDI portal
(Redirected from Publication:812417)
Recommendations
Cites work
- An inexact algorithm for the sequential ordering problem
- Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
- scientific article; zbMATH DE number 432754 (Why is no real title available?)
- scientific article; zbMATH DE number 3898613 (Why is no real title available?)
- scientific article; zbMATH DE number 1321699 (Why is no real title available?)
- scientific article; zbMATH DE number 236854 (Why is no real title available?)
- New Rollout Algorithms for Combinatorial Optimization Problems
- Optimization by simulated annealing
- Rollout algorithms for combinatorial optimization
- Rollout algorithms for stochastic scheduling problems
- TSPLIB—A Traveling Salesman Problem Library
Cited in
(10)- Faster rollout search for the vehicle routing problem with stochastic demands and restocking
- A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs
- Patient scheduling in hemodialysis service
- Comparing heuristics for the product allocation problem in multi-level warehouses under compatibility constraints
- Rollout algorithms for combinatorial optimization
- Minimum and worst-case performance ratios of rollout algorithms
- scientific article; zbMATH DE number 2030016 (Why is no real title available?)
- New Rollout Algorithms for Combinatorial Optimization Problems
- A rollout algorithm for the resource constrained elementary shortest path problem
- Parallel rollout for online solution of partially observable Markov decision processes
This page was built for publication: Parallelization strategies for rollout algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q812417)