A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation (Q3875702): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:45, 5 February 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
