On dual solutions of the linear assignment problem |
| |
| Authors: | G Kindervater A Volgenant G de Leve V van Gijlswijk |
| |
| Institution: | University of Amsterdam, Institute of Actuarial Sciences, Burgemeester Tellengenhuis, Jodenbreestraat 13, 1011 NH Amsterdam, The Netherlands |
| |
| Abstract: | For the linear assignment problem we describe how to obtain different dual solutions. It turns out that a shortest path algorithm can be used to compute such solutions with several interesting properties that enable to do better post-optimality analysis.Two examples illustrate how different dual solutions can be used in the context of the traveling salesman problem. |
| |
| Keywords: | Assignment programming integer programming linear programming scheduling |
| 本文献已被 ScienceDirect 等数据库收录！ |
