Acknowledgements
The authors are grateful to anonymous referees for suggestions that enabled a
substantial improvement to the presentation of the paper.
References
[1] Ahuja, R.K., Magnanti, T., and Orlin J.B., Network Flows: Theory, Algo-
rithms and Applications, Prentice Hall, New Jersey, 1993
[2] Baccelli, F.L., G. Cohen, G.-J. Olsder, and J.-P. Quadrat, Synchronization
and Linearity. (J.Wiley and Sons, New York, 1992).
[3] Burkard, R.E., Selected topics in assignment problems., Discrete Applied
Mathematics 123 (2002), 257-302.
[4] Burkard, R.E. and P. Butkovic, Finding all essential terms of a character-
istic maxpolynomial, Discrete Applied Mathematics 130 (2003), 367-380.
[5] Burkard, R.E. and P. Butkovic, Max algebra and the linear assignment
problem, Math. Program., Ser.B 98 (2003), 415-429.
[6] Burkard, R.E. and E. Cela, Linear Assignment Problems and Extensions,
in Handbook of Combinatorial Optimization (P.M.Pardalos and D.-Z.Du,
Eds.), Supplement Volume A, Kluwer Academic Publishers, 75-149, 1999.
[7] Burkard, R.E. and R.A. Cuninghame-Green, private communication.
[8] Butkovic, P., On the complexity of computing the coefficients of max-
algebraic characteristic polynomial and characteristic equation. Kyber-
netika 39 (2003), No. 2, 129-136.
[9] Butkovic, P. and R.A. Cuninghame-Green, The linear assignment problem
for special matrices. IMA journal of Management Mathematics 15 (2004),
1-12.
[10] Butkovic, P. and L. Murfitt, Calculating essential terms of a characteristic
maxpolynomial. CEJOR 8 (2000), 237-246.
[11] Cuninghame-Green, R.A., Minimax Algebra. Lecture Notes in Economics
and Math. Systems 166, (Springer, Berlin, 1979).
19