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

@@ Property / Mathematics Subject Classification ID @@
+C39
@@ Property / Mathematics Subject Classification ID: 90C39 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C59
@@ Property / Mathematics Subject Classification ID: 90C59 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C60
@@ Property / Mathematics Subject Classification ID: 90C60 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6031727
@@ Property / zbMATH DE Number: 6031727 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+rollout algorithms
@@ Property / zbMATH Keywords: rollout algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+minimum performance ratio
@@ Property / zbMATH Keywords: minimum performance ratio / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+worst-case performance ratio
@@ Property / zbMATH Keywords: worst-case performance ratio / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Knapsack
@@ Property / describes a project that uses: Knapsack / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10957-011-9902-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2017478816
@@ Property / OpenAlex ID: W2017478816 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4257216
@@ Property / cites work: Q4257216 / rank @@
+Normal rank
@@ Property / cites work @@
+Rollout algorithms for stochastic scheduling problems
+Normal rank
@@ Property / cites work @@
+Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
+Normal rank
@@ Property / cites work @@
+A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
+Normal rank
@@ Property / cites work @@
+Analysis of a rollout approach to sequencing problems with stochastic routing applications
+Normal rank
@@ Property / cites work @@
+An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
+Normal rank
@@ Property / cites work @@
+Parallelization strategies for rollout algorithms
@@ Property / cites work: Parallelization strategies for rollout algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Rollout algorithms for combinatorial optimization
@@ Property / cites work: Rollout algorithms for combinatorial optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Hybrid rollout approaches for the job shop scheduling problem
+Normal rank
@@ Property / cites work @@
+An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Algorithms for the 0/1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for knapsack problems with cardinality constraints
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for Knapsack Problems
+Normal rank
@@ Property / cites work @@
+A new fully polynomial time approximation scheme for the Knapsack problem
+Normal rank
@@ Property / cites work @@
+Improved dynamic programming in connection with an FPTAS for the knapsack problem
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:415370