Results for the close-enough traveling salesman problem with a branch-and-bound algorithm (Q6097759): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:10, 10 July 2024
scientific article; zbMATH DE number 7693258
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Results for the close-enough traveling salesman problem with a branch-and-bound algorithm |
scientific article; zbMATH DE number 7693258 |
Statements
Results for the close-enough traveling salesman problem with a branch-and-bound algorithm (English)
0 references
7 June 2023
0 references
close-enough traveling salesman problem
0 references
branch-and-bound algorithm
0 references
combinatorial optimization
0 references
computation
0 references
