THE TRAVELING SALESMAN PROBLEM: APPROXIMATE ALGORITHM BY BRANCH-AND-BOUND METHOD WITH GUARANTEED PRECISION (Q5151281): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An Algorithm for the Traveling Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5150579 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5150604 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The traveling salesman problem. II: Exact methods / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The traveling salesman problem. Approximate algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4739657 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4091421 / rank | |||
Normal rank | |||
Latest revision as of 14:23, 24 July 2024
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
