A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q5326770): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.21459 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2156398306 / rank | |||
Normal rank | |||
Revision as of 19:12, 19 March 2024
scientific article; zbMATH DE number 6195665
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks |
scientific article; zbMATH DE number 6195665 |
Statements
A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (English)
0 references
6 August 2013
0 references
traveling salesman
0 references
pickup
0 references
delivery
0 references
loading
0 references
multiple stacks
0 references
