Minimum and worst-case performance ratios of rollout algorithms (Q415370): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4257216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rollout algorithms for stochastic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a rollout approach to sequencing problems with stochastic routing applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate dynamic programming approach for the vehicle routing problem with stochastic demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelization strategies for rollout algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rollout algorithms for combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid rollout approaches for the job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Algorithms for the 0/1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for knapsack problems with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new fully polynomial time approximation scheme for the Knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved dynamic programming in connection with an FPTAS for the knapsack problem / rank
 
Normal rank

Latest revision as of 04:38, 5 July 2024

scientific article
Language Label Description Also known as
English
Minimum and worst-case performance ratios of rollout algorithms
scientific article

    Statements

    Minimum and worst-case performance ratios of rollout algorithms (English)
    0 references
    0 references
    8 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    rollout algorithms
    0 references
    minimum performance ratio
    0 references
    worst-case performance ratio
    0 references
    0 references