A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation (Q1158108)
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: A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation |
scientific article; zbMATH DE number 3739315
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation |
scientific article; zbMATH DE number 3739315 |
Statements
A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation (English)
0 references
1982
0 references
branch and bound algorithm
0 references
symmetric traveling salesman
0 references
1-tree relaxation
0 references
heuristic solutions
0 references
computational results
0 references
Lagrangean approach
0 references
