New lower bounds for the symmetric travelling salesman problem (Q1824572): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: VRP / rank | |||
Normal rank | |||
Revision as of 18:12, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New lower bounds for the symmetric travelling salesman problem |
scientific article |
Statements
New lower bounds for the symmetric travelling salesman problem (English)
0 references
1989
0 references
lower bounds
0 references
Symmetric Travelling Salesman Problem
0 references
additive bounding procedures
0 references
reduced costs
0 references
Shortest Spanning Tree
0 references
randomly generated test problems
0 references
