An algorithm to determine a path with minimal cost/capacity ratio (Q5902840): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:49, 30 January 2024
scientific article; zbMATH DE number 3914112
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm to determine a path with minimal cost/capacity ratio |
scientific article; zbMATH DE number 3914112 |
Statements
An algorithm to determine a path with minimal cost/capacity ratio (English)
0 references
1984
0 references
We present a polynomial algorithm to determine a path between a specified pair of nodes, which minimizes the cost/capacity ratio. Some computational experiments are also reported.
0 references
optimal path
0 references
polynomial algorithm
0 references
specified pair of nodes
0 references
computational experiments
0 references
