The cardinality constrained covering traveling salesman problem (Q1869889)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The cardinality constrained covering traveling salesman problem |
scientific article; zbMATH DE number 1902964
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The cardinality constrained covering traveling salesman problem |
scientific article; zbMATH DE number 1902964 |
Statements
The cardinality constrained covering traveling salesman problem (English)
0 references
28 April 2003
0 references
Hamiltonian subgraphs
0 references
cardinality constrained covering traveling salesman
0 references
problem
0 references
heuristics
0 references
0 references
0 references
0.7834985852241516
0 references
0.7765726447105408
0 references
0.7601580023765564
0 references
0.7534750699996948
0 references
