A note on dual solutions of the assignment problem in connection with the traveling salesman problem (Q911984): Difference between revisions
From MaRDI portal
Latest revision as of 14:21, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on dual solutions of the assignment problem in connection with the traveling salesman problem |
scientific article |
Statements
A note on dual solutions of the assignment problem in connection with the traveling salesman problem (English)
0 references
1990
0 references
A new technique for the computation of a lower bound for the travelling salesman problem is proposed. The algorithm of Christofides is modified with a procedure for the calculation of the subgradients of the bound function.
0 references
lower bound
0 references
travelling salesman
0 references
subgradients
0 references
0 references
0 references
