Locating a cycle in a transportation or a telecommunications network (Q3593375)
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: Locating a cycle in a transportation or a telecommunications network |
scientific article; zbMATH DE number 5173301
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Locating a cycle in a transportation or a telecommunications network |
scientific article; zbMATH DE number 5173301 |
Statements
Locating a cycle in a transportation or a telecommunications network (English)
0 references
20 July 2007
0 references
cycle location
0 references
transportation
0 references
telecommunications
0 references
traveling salesman problem
0 references
Hamiltonian cycles
0 references
branch-and-cut
0 references
heuristics
0 references
0 references
0.8185946345329285
0 references
0.7867029905319214
0 references
0.7723224759101868
0 references
0.7691918015480042
0 references
