The multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q1041945)
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: The multi-commodity one-to-one pickup-and-delivery traveling salesman problem |
scientific article; zbMATH DE number 5642761
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The multi-commodity one-to-one pickup-and-delivery traveling salesman problem |
scientific article; zbMATH DE number 5642761 |
Statements
The multi-commodity one-to-one pickup-and-delivery traveling salesman problem (English)
0 references
7 December 2009
0 references
traveling salesman
0 references
pickup-and-delivery
0 references
branch-and-cut
0 references
dial-a-ride
0 references
0 references
0 references
0 references
0 references
