An algorithm to determine a path with minimal cost/capacity ratio (Q5902840): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A bicriterion shortest path algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3888874 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Shortest Path and Network Flow Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a special class of bicriterion path problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hyperbolic programming / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(84)90100-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2001125358 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:46, 30 July 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
