Results for the close-enough traveling salesman problem with a branch-and-bound algorithm (Q6097759)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7693258
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8850061297416687
0 references
0.8083966970443726
0 references
0.8079392313957214
0 references
0.7982276678085327
0 references
0.7503000497817993
0 references
