The traveling salesman problem on a graph and some related integer polyhedra (Q3675933)
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 3896698
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The traveling salesman problem on a graph and some related integer polyhedra |
scientific article; zbMATH DE number 3896698 |
Statements
The traveling salesman problem on a graph and some related integer polyhedra (English)
0 references
1985
0 references
graphical traveling Salesman
0 references
minimum length cycle
0 references
facet
0 references
comb inequalities
0 references
integer polyhedra
0 references
efficient algorithm
0 references
Steiner tree
0 references
polynomial algorithm
0 references
series-parallel graph
0 references
0 references
0 references
0.8375995755195618
0 references
0.8361578583717346
0 references
0.8260511159896851
0 references
0.8168179392814636
0 references
0.8149265050888062
0 references
