A lower bound for the shortest Hamiltonean path in directed graphs (Q1814249): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 23:31, 4 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound for the shortest Hamiltonean path in directed graphs |
scientific article |
Statements
A lower bound for the shortest Hamiltonean path in directed graphs (English)
0 references
25 June 1992
0 references
The authors present a Lagrange relaxation of a particular formulation for the shortest Hamiltonian path problem in a directed graph. The relaxation has not the integrality property, but the adequate dual problem defines a lower bound. The dual problem is to find a shortest path with a fixed number of arcs. To solve this one must solve a classical shortest path problem with nonnegative length.
0 references
travelling salesman
0 references
Lagrange relaxation
0 references
shortest Hamiltonian path problem
0 references
directed graph
0 references
