On dual solutions of the linear assignment problem (Q761971)
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: On dual solutions of the linear assignment problem |
scientific article; zbMATH DE number 3889276
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On dual solutions of the linear assignment problem |
scientific article; zbMATH DE number 3889276 |
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
0 references
0.847461462020874
0 references
0.8172992467880249
0 references
0.81377774477005
0 references
0.8128018379211426
0 references
