A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints (Q1198141)
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 matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints |
scientific article; zbMATH DE number 92342
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints |
scientific article; zbMATH DE number 92342 |
Statements
A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints (English)
0 references
16 January 1993
0 references
vehicle routing
0 references
time window constraints
0 references
set partitioning
0 references
matching
0 references
non-smooth optimization
0 references
approximate solutions
0 references
0 references
