The stochastic problem of synthesizing the shortest connecting network (Q1903461)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The stochastic problem of synthesizing the shortest connecting network |
scientific article; zbMATH DE number 821830
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The stochastic problem of synthesizing the shortest connecting network |
scientific article; zbMATH DE number 821830 |
Statements
The stochastic problem of synthesizing the shortest connecting network (English)
0 references
10 January 1996
0 references
The problem studied here is a generalization of problems of finding the shortest paths in directed graphs that takes into account the two-stage nature of the synthesis procedure and the inaccuracy of the data for the second stage. A method is presented for solving the two-stage stochastic problem of synthesizing the shortest connecting network by using the criterion of the minimum mathematical expectation of the overall cost. In conclusion, a qualitative estimate of the complexity of the solution to this problem is obtained, based on the practical effectiveness of successive calculations.
0 references
supermodular function
0 references
two-stage stochastic problem
0 references
shortest connecting network
0 references
0.7828797698020935
0 references
0.7780071496963501
0 references
