A branch-and-bound algorithm for the close-enough traveling salesman problem (Q2960368)
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 6682181
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound algorithm for the close-enough traveling salesman problem |
scientific article; zbMATH DE number 6682181 |
Statements
A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem (English)
0 references
8 February 2017
0 references
close-enough traveling salesman problem
0 references
branch-and-bound
0 references
second-order cone programming
0 references
0 references
0 references
0.8850061297416687
0 references
0.8495672941207886
0 references
0.8322699069976807
0 references
0.821678638458252
0 references
0.7801328897476196
0 references
