Approximative solutions to the bicriterion vehicle routing problem with time windows (Q1038402)
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: Approximative solutions to the bicriterion vehicle routing problem with time windows |
scientific article; zbMATH DE number 5634756
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximative solutions to the bicriterion vehicle routing problem with time windows |
scientific article; zbMATH DE number 5634756 |
Statements
Approximative solutions to the bicriterion vehicle routing problem with time windows (English)
0 references
17 November 2009
0 references
logistics
0 references
heuristics
0 references
bicriterion optimization
0 references
vehicle routing with soft time windows
0 references
0 references
0 references
0 references
