Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs (Q621695)
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 5842698
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs |
scientific article; zbMATH DE number 5842698 |
Statements
Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs (English)
0 references
28 January 2011
0 references
period routing problem
0 references
logistics
0 references
0.770934522151947
0 references
0.7590357065200806
0 references
0.7505722641944885
0 references
0.7449913620948792
0 references
0.7406948208808899
0 references
