Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees (Q489718)
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: Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees |
scientific article; zbMATH DE number 6388494
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees |
scientific article; zbMATH DE number 6388494 |
Statements
Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees (English)
0 references
21 January 2015
0 references
traveling salesman
0 references
vehicle routing
0 references
local search
0 references
approximation algorithms
0 references
0 references
0 references
0 references
0.8407763242721558
0 references
0.8322479128837585
0 references
0.8232348561286926
0 references
0.8173609375953674
0 references
