The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms (Q5434593): 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.1002/net.20209 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4256246856 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:46, 19 March 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
