A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation (Q3875702)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation |
scientific article; zbMATH DE number 3679547
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation |
scientific article; zbMATH DE number 3679547 |
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
