Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows (Q3801320)
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: Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows |
scientific article; zbMATH DE number 4068594
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows |
scientific article; zbMATH DE number 4068594 |
Statements
Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows (English)
0 references
1988
0 references
Lagrangian methods
0 references
minimal fleet size
0 references
multiple traveling salesman
0 references
time window constraints
0 references
NP-complete
0 references
network flow
0 references
relaxation
0 references
0.7870537638664246
0 references
0.7730652689933777
0 references
0.7690154910087585
0 references
0.7533057928085327
0 references
