The shortest multipaths problem in a capacitated dense channel (Q859708)
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 shortest multipaths problem in a capacitated dense channel |
scientific article; zbMATH DE number 5116402
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The shortest multipaths problem in a capacitated dense channel |
scientific article; zbMATH DE number 5116402 |
Statements
The shortest multipaths problem in a capacitated dense channel (English)
0 references
16 January 2007
0 references
combinatorial optimization
0 references
capacitated multipaths problem
0 references
grid graph
0 references
polynomial-time algorithm
0 references
0 references
0.89798456
0 references
0.88106996
0 references
0.8688675
0 references
0.8675649
0 references
0.86048234
0 references
0.85820514
0 references
0.8576612
0 references
