An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem (Q2940530)
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 6391175
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem |
scientific article; zbMATH DE number 6391175 |
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
0.9233008
0 references
0.92226946
0 references
0 references
0.90703076
0 references
0.9060651
0 references
0.9044246
0 references
0.8989842
0 references
0.8973351
0 references
0.89733505
0 references
0.8903813
0 references
