The traveling salesman problem on a graph and some related integer polyhedra (Q3675933): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01582008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083210138 / rank | |||
Normal rank | |||
Latest revision as of 08:33, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The traveling salesman problem on a graph and some related integer polyhedra |
scientific article |
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
