Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem (Q1824571): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:53, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem |
scientific article |
Statements
Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem (English)
0 references
1990
0 references
branch and bound
0 references
depth first search
0 references
symmetric traveling salesman
0 references
