On dual solutions of the linear assignment problem (Q761971): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(85)90310-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2028068470 / rank | |||
Normal rank | |||
Latest revision as of 13:38, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On dual solutions of the linear assignment problem |
scientific article |
Statements
On dual solutions of the linear assignment problem (English)
0 references
1985
0 references
The linear assignment problem (LAP) which is a relaxation of many cominatorial problems such as the traveling salesman problem, delivery and school bus problems, vehicle scheduling problems, the quadratic assignment problem, is considered and a shortest path algorithm is used to compute different dual solutions of the LAP. Two applications in the context of the traveling salesman problem are proposed.
0 references
linear assignment
0 references
shortest path algorithm
0 references
dual solutions
0 references
traveling salesman
0 references
