The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms (Q5434593): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:05, 9 February 2024
scientific article; zbMATH DE number 5223729
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms |
scientific article; zbMATH DE number 5223729 |
Statements
The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms (English)
0 references
7 January 2008
0 references
traveling salesman
0 references
pickup-and-delivery
0 references
branch-and-cut
0 references
