A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem (Q2960368)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem |
scientific article |
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
