Online traveling salesman problem with time cost and non-zealous server (Q2082223)
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: Online traveling salesman problem with time cost and non-zealous server |
scientific article; zbMATH DE number 7595937
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Online traveling salesman problem with time cost and non-zealous server |
scientific article; zbMATH DE number 7595937 |
Statements
Online traveling salesman problem with time cost and non-zealous server (English)
0 references
4 October 2022
0 references
online algorithm
0 references
emergency vehicle routing
0 references
traveling salesman problem
0 references
per-unit-time cost
0 references
0 references
0.90825725
0 references
0.89651626
0 references
0.8763685
0 references
0.8752522
0 references
0.8735347
0 references
0.87322706
0 references
0 references
0.8701581
0 references
0.8695794
0 references
0.86732435
0 references
