A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem (Q1026674): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.nonrwa.2008.03.014 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2138388627 / rank | |||
Revision as of 05:55, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem |
scientific article |
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
