An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections (Q4422622): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/net.10079 / rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4532232 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NET.10079 / rank | |||
Normal rank | |||
Latest revision as of 01:13, 30 December 2024
scientific article; zbMATH DE number 1968015
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections |
scientific article; zbMATH DE number 1968015 |
Statements
An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections (English)
0 references
20 August 2003
0 references
traveling salesman problem
0 references
delivery and collection
0 references
valid inequalities
0 references
branch and cut
0 references
