Min-Max \(K\)-vehicles windy rural postman problem (Q3057121)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5818773
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Min-Max \(K\)-vehicles windy rural postman problem |
scientific article; zbMATH DE number 5818773 |
Statements
Min-Max <i>K</i> -vehicles windy rural postman problem (English)
0 references
24 November 2010
0 references
facets
0 references
multivehicles
0 references
0 references
0.9282801747322084
0 references
0.9199669361114502
0 references
0.9073368310928344
0 references
0.8144400715827942
0 references
0.8035045266151428
0 references
