An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections (Q4422622): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CPLEX / rank | |||
Normal rank | |||
| 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.1002/net.10079 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2105006450 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4532232 / rank | |||
Normal rank | |||
Latest revision as of 09:06, 6 June 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
