Branch-and-cut approach to a variant of the traveling salesman problem (Q3812063)
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 4081325
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-and-cut approach to a variant of the traveling salesman problem |
scientific article; zbMATH DE number 4081325 |
Statements
Branch-and-cut approach to a variant of the traveling salesman problem (English)
0 references
1988
0 references
modified traveling salesman
0 references
zero-one linear program
0 references
polynomial time
0 references
branch-and-cut
0 references
0.8045392632484436
0 references
0.7904569506645203
0 references
0.7863808870315552
0 references
0.7830158472061157
0 references
0.7794241905212402
0 references
