An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles (Q2185648)
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: An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles |
scientific article; zbMATH DE number 7209001
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles |
scientific article; zbMATH DE number 7209001 |
Statements
An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles (English)
0 references
5 June 2020
0 references
cycle cover
0 references
max TSP
0 references
maximum traveling salesman problem
0 references
polyhedral metric
0 references
optimal solution
0 references
polynomial-time algorithm
0 references
0 references
0.8069524168968201
0 references
0.8058295249938965
0 references
0.8009188771247864
0 references
