An exact algorithm for the Split-Demand One-Commodity Pickup-And-Delivery Travelling Salesman problem (Q1661892): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/978-3-319-96151-4_21 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2883777183 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 00:17, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An exact algorithm for the Split-Demand One-Commodity Pickup-And-Delivery Travelling Salesman problem |
scientific article |
Statements
An exact algorithm for the Split-Demand One-Commodity Pickup-And-Delivery Travelling Salesman problem (English)
0 references
17 August 2018
0 references