Minimum and worst-case performance ratios of rollout algorithms
From MaRDI portal
Publication:415370
DOI10.1007/s10957-011-9902-7zbMath1237.90246OpenAlexW2017478816MaRDI QIDQ415370
Publication date: 8 May 2012
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-011-9902-7
Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)
Related Items
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 ⋮ Average-case performance of rollout algorithms for knapsack problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Parallelization strategies for rollout algorithms
- Hybrid rollout approaches for the job shop scheduling problem
- An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
- A new fully polynomial time approximation scheme for the Knapsack problem
- Analysis of a rollout approach to sequencing problems with stochastic routing applications
- Approximation algorithms for knapsack problems with cardinality constraints
- Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
- Improved dynamic programming in connection with an FPTAS for the knapsack problem
- Rollout algorithms for stochastic scheduling problems
- Rollout algorithms for combinatorial optimization
- An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
- A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Approximate Algorithms for the 0/1 Knapsack Problem
