A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem (Q1026674)
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: A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem |
scientific article; zbMATH DE number 5571239
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem |
scientific article; zbMATH DE number 5571239 |
Statements
A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem (English)
0 references
29 June 2009
0 references
unmanned vehicles
0 references
combinatorial optimization
0 references
Lagrangian relaxation
0 references
traveling salesman problem (TSP)
0 references
motion planning
0 references
Dubins' vehicles
0 references
dynamic programming
0 references
0 references
