Name
Abstract | ||
|---|---|---|
Summary The optimal routing of a decision maker in a network is considered. Some branches of the network can take on a finite or an infinite cost with a given probability. The costs of the stochastic branches which depart from a node become known to the decision maker whenever he visits the node. Without visiting the node, information on a stochastic branch can also be acquired under the payment of an observation cost. |
Year | DOI | Venue |
|---|---|---|
1977 | 10.1007/BF01919769 | Math. Meth. of OR |
Field | DocType | Volume |
Decision rule,Dynamic programming,Mathematical optimization,Computer science,Payment,Decision maker | Journal | 21 |
Issue | Citations | PageRank |
3 | 0 | 0.34 |
References | Authors | |
1 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| G. Barla | 1 | 0 | 0.34 |
| G. Bartolini | 2 | 0 | 0.34 |
| R. Zoppoli | 3 | 279 | 51.51 |