Efficient algorithms for the double traveling salesman problem with multiple stacks (Q1762078): 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.1016/j.cor.2011.06.008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2169677796 / rank | |||
Normal rank | |||
Revision as of 02:52, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for the double traveling salesman problem with multiple stacks |
scientific article |
Statements
Efficient algorithms for the double traveling salesman problem with multiple stacks (English)
0 references
15 November 2012
0 references
traveling salesman problem
0 references
LIFO constraints
0 references
efficient algorithms
0 references
heuristics
0 references
