Bicriteria path problem minimizing the cost and minimizing the number of labels (Q385462)
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: Bicriteria path problem minimizing the cost and minimizing the number of labels |
scientific article; zbMATH DE number 6235149
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bicriteria path problem minimizing the cost and minimizing the number of labels |
scientific article; zbMATH DE number 6235149 |
Statements
Bicriteria path problem minimizing the cost and minimizing the number of labels (English)
0 references
2 December 2013
0 references
minimal cost
0 references
minimal number of labels
0 references
bicriteria
0 references
shortest path
0 references
0.8397542238235474
0 references
0.7939314842224121
0 references
0.7923220992088318
0 references
0.7869461178779602
0 references
0.7830696105957031
0 references
