An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem (Q2940530)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem |
scientific article |
Statements
An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem (English)
0 references
27 January 2015
0 references
close-enough traveling salesman problem
0 references
geometric routing problems
0 references
mixed-integer programming
0 references
computational geometry
0 references
discretization
0 references
0 references
0 references
