Efficient, optimal stochastic-action selection when limited by an action budget (Q5962147): Difference between revisions

@@ Property / DOI @@
-.1007/s00186-010-0305-6
@@ Property / DOI: 10.1007/s00186-010-0305-6 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00186-010-0305-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2113451815
@@ Property / OpenAlex ID: W2113451815 / rank @@
+Normal rank
@@ Property / cites work @@
+Stochastic shortest paths with recourse
@@ Property / cites work: Stochastic shortest paths with recourse / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138961
@@ Property / cites work: Q3138961 / rank @@
+Normal rank
@@ Property / cites work @@
+A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
+Normal rank
@@ Property / cites work @@
+An analysis of approximations for maximizing submodular set functions—I
+Normal rank
@@ Property / cites work @@
+Shortest paths without a map
@@ Property / cites work: Shortest paths without a map / rank @@
+Normal rank
@@ Property / cites work @@
+Stochastic shortest path problems with recourse
@@ Property / cites work: Stochastic shortest path problems with recourse / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm to find shortest paths with recourse
+Normal rank
@@ Property / cites work @@
+A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
+Normal rank
@@ Property / cites work @@
+Q3549686
@@ Property / cites work: Q3549686 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00186-010-0305-6
@@ Property / DOI: 10.1007/S00186-010-0305-6 / rank @@
+Normal rank