Reduction rules for the covering tour problem (Q2741492)
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 1642893
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reduction rules for the covering tour problem |
scientific article; zbMATH DE number 1642893 |
Statements
24 October 2001
0 references
traveling salesman problem
0 references
covering tour problem
0 references
undirected graph
0 references
Hamiltonian cycle
0 references
linear program
0 references
Reduction rules for the covering tour problem (English)
0 references
0.8485828638076782
0 references
0.8101760745048523
0 references
0.8099206686019897
0 references
0.8070369958877563
0 references
0.783251941204071
0 references
