The Covering Tour Problem (Q4363758)
From MaRDI portal
!
WARNING
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 1085263
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Covering Tour Problem |
scientific article; zbMATH DE number 1085263 |
Statements
The Covering Tour Problem (English)
0 references
25 May 1998
0 references
covering tour problem
0 references
minimum length Hamiltonian cycle
0 references
exact branch-and-cut algorithm
0 references
heuristic
0 references
0.9004931449890137
0 references
0.8645773530006409
0 references
0.855943500995636
0 references
0.8485828638076782
0 references
