Software ORM

Software

Linear Assignment Problem (LAP)

• An addendum on sensitivity analysis of the optimal assignment. European Journal of Operational Research 169 (2006) 338-339.
• Solving the k-cardinality assignment problem by transformation. European Journal of Operational Research 157 (2004) 322–331.
• A note on the assignment problem with seniority and job priority constraints. European Journal of Operational Research 154 (2004) 330–335.
• Solving some lexicographic multi-objective combinatorial problems.European Journal of Operational Research 139 (2002) 578–584.
• Linear Assignment Procedures (R. Jonker), ** European Journal of Operational Research 116 (1999) 233-234.
• Linear and Semi Assignment Problems: a core oriented approach. Computers & Operations Research 23 (1996) 917-932.
• Minimum Deviation and Balanced Optimization: a unified approach (C.W. Duin), Operations Research Letters 10 (1991) 43-48.
• Better Assignment Lower Bounds for the Euclidean Traveling Salesman Problem (R. Jonker, H.J. van der Sluis), Optimization 18 (1987) 393-404.
• Shortest Path Algorithm for Dense and Sparse Linear Assignment Problems (R. Jonker), Computing 38 (1987) 325-340.
• Improving the Hungarian assignment algorithm (R. Jonker), Operations Research Letters 5 (1986) 171-175.
• On dual solutions of the linear assignment problem (G. Kindervater, G. de Leve, V. van Gijlswijk), European Journal of Operational Research 19 (1985) 76-81.
   

** The procedures can all be obtained in the language Pascal and some of them in Fortran and C++.