Minimum and worst-case performance ratios of rollout algorithms
From MaRDI portal
Publication:415370
DOI10.1007/S10957-011-9902-7zbMATH Open1237.90246OpenAlexW2017478816MaRDI QIDQ415370FDOQ415370
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
Recommendations
- Average-case performance of rollout algorithms for knapsack problems
- AN APPROACH FOR WORST CASE ANALYSIS OF HEURISTICS : ANALYSIS OF A FLEXIBLE 0-1 KNAPSACK PROBLEM
- A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs
- Rollout algorithms for combinatorial optimization
- New Rollout Algorithms for Combinatorial Optimization Problems
Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
- Approximation algorithms for knapsack problems with cardinality constraints
- Rollout algorithms for combinatorial optimization
- An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
- Rollout algorithms for stochastic scheduling problems
- A Rollout Policy 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
- 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
- Hybrid rollout approaches for the job shop scheduling problem
- Parallelization strategies for rollout algorithms
Cited In (7)
- Patient scheduling in hemodialysis service
- 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
- Expectation analysis for bounding solutions of the 0-1 knapsack problem
- New Rollout Algorithms for Combinatorial Optimization Problems
- Rollout algorithms for combinatorial optimization
- Average-case performance of rollout algorithms for knapsack problems
Uses Software
This page was built for publication: Minimum and worst-case performance ratios of rollout algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415370)
