Minimum cost path problems with relays (Q709122)
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: Minimum cost path problems with relays |
scientific article; zbMATH DE number 5800799
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum cost path problems with relays |
scientific article; zbMATH DE number 5800799 |
Statements
Minimum cost path problems with relays (English)
0 references
15 October 2010
0 references
relays
0 references
shortest path problem
0 references
bicriteria optimization
0 references
labeling algorithms
0 references
0.89314586
0 references
0.85493135
0 references
0.83589286
0 references
0.8322767
0 references
0 references
0 references
0.82596374
0 references
0.81977594
0 references
