A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks (Q5326779): 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.21468 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2168881324 / rank | |||
Normal rank | |||
Revision as of 01:32, 20 March 2024
scientific article; zbMATH DE number 6195674
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks |
scientific article; zbMATH DE number 6195674 |
Statements
A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks (English)
0 references
6 August 2013
0 references
double traveling salesman problem
0 references
pickup and delivery problems
0 references
branch-and-bound
0 references
LIFO
0 references
multiple stacks
0 references
