An exact algorithm for the Split-Demand One-Commodity Pickup-And-Delivery Travelling Salesman problem (Q1661892)
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: An exact algorithm for the Split-Demand One-Commodity Pickup-And-Delivery Travelling Salesman problem |
scientific article; zbMATH DE number 6919953
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact algorithm for the Split-Demand One-Commodity Pickup-And-Delivery Travelling Salesman problem |
scientific article; zbMATH DE number 6919953 |
Statements
An exact algorithm for the Split-Demand One-Commodity Pickup-And-Delivery Travelling Salesman problem (English)
0 references
17 August 2018
0 references
0.9620358
0 references
0.9514724
0 references
0.93099767
0 references
0.9246438
0 references
0.91710687
0 references
0.91294026
0 references
0.9017568
0 references
0.89932305
0 references
