Finding a contour with the smallest mean expenses in a graph with variable arc lengths. The simplest case (Q2404509): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 07:01, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a contour with the smallest mean expenses in a graph with variable arc lengths. The simplest case |
scientific article |
Statements
Finding a contour with the smallest mean expenses in a graph with variable arc lengths. The simplest case (English)
0 references
19 September 2017
0 references
optimal contour
0 references
Bellman equation
0 references
contour with minimal mean expenses
0 references
tropical mathematics
0 references
