Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm (Q5060054)
From MaRDI portal
scientific article; zbMATH DE number 7643290
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm |
scientific article; zbMATH DE number 7643290 |
Statements
Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm (English)
0 references
17 January 2023
0 references
branch and bound
0 references
traveling salesman problem
0 references
linear decision tree
0 references
clique number
0 references
direct type algorithm
0 references
0 references
