THE TRAVELING SALESMAN PROBLEM: APPROXIMATE ALGORITHM BY BRANCH-AND-BOUND METHOD WITH GUARANTEED PRECISION (Q5151281)
From MaRDI portal
scientific article; zbMATH DE number 7311674
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | THE TRAVELING SALESMAN PROBLEM: APPROXIMATE ALGORITHM BY BRANCH-AND-BOUND METHOD WITH GUARANTEED PRECISION |
scientific article; zbMATH DE number 7311674 |
Statements
THE TRAVELING SALESMAN PROBLEM: APPROXIMATE ALGORITHM BY BRANCH-AND-BOUND METHOD WITH GUARANTEED PRECISION (English)
0 references
17 February 2021
0 references
traveling salesman problem
0 references
branch-and-border method
0 references
approximate algorithm
0 references
local search
0 references
computational experiment
0 references
