Algorithms for source-to-all maximum cost-to-time ratio problem in acyclic networks (Q4422619)
From MaRDI portal
scientific article; zbMATH DE number 1968012
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for source-to-all maximum cost-to-time ratio problem in acyclic networks |
scientific article; zbMATH DE number 1968012 |
Statements
Algorithms for source-to-all maximum cost-to-time ratio problem in acyclic networks (English)
0 references
20 August 2003
0 references
networks
0 references
graphs
0 references
flow algorithms
0 references
