Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows (Q3801320)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows |
scientific article |
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
