A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation (Q3875702): 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.1007/bfb0120889 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W75977199 / rank | |||
Normal rank | |||
Revision as of 08:43, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation |
scientific article |
Statements
A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation (English)
0 references
1980
0 references
asymmetric travelling salesman problem
0 references
one-arborescence relaxation
0 references
LIFO implicit enumeration algorithm
0 references
comparison of algorithms
0 references
algorithmic performance analysis
0 references
