Max algebra and the linear assignment problem

Mathematical Programming

Volumn 98, Issue 1-3, 2003, Pages 415-429

  Burkard, Rainer E ^a   Butkovič, Peter ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Assignment problem; Best principal submatrix assignment problem; Characteristic maxpolynomial; Discrete event system; Job rotation problem; Max algebra; Permanent; Regular matrix

Indexed keywords

ASSIGNMENT PROBLEMS; CHARACTERISTIC MAXPOLYNOMIAL; JOB ROTATION; MAX-ALGEBRA; PERMANENT;

ALGEBRA; DISCRETE EVENT SIMULATION; EIGENVALUES AND EIGENFUNCTIONS; LINEAR EQUATIONS;

MATRIX ALGEBRA;

EID: 33847336504     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-003-0411-9     Document Type: Conference Paper

References (25)

1. Baccelli, F.L., Cohen, G., Olsder, G.-J., Quadrat, J.-P.: Synchronization and Linearity. Chichester, New York: J.Wiley and Sons, 1992
2. Burkard, R.E., Butković, P.: Finding all essential terms of a characteristic maxpolynomial. SFB Report No.249, Instituteof Mathematics, Graz University ofTechnology, May 2002.Toappear in DiscreteAppl. Math. Available as ftp://ftp.tu-graz.ac.at/pub/papers/math/sfb249.ps.gz.
3. Butković, P.: Strong regularity of matrices-a survey of results. Discrete Appl. Math. 48, 45-68 (1994)
4. Butković, P.: Regularity of matrices in min-algebra and its time-complexity. Discrete Appl. Math. 57, 121-132 (1995)
5. Butković, P.: Simple image set of (max, +) linear mappings. Discrete Appl. Math. 105, 73-86 (2000)
6. Butković, P., Murfitt, L.: Calculating essential terms of a characteristic maxpolynomial. CEJOR 8, 237-246 (2000)
7. Carré, B.A.: An algebra for network routing problems. J. Inst. Math. Appl. 7, 273-294 (1971)
8. Cuninghame-Green, R.A.: Process synchronisation in a steelworks-a problem of feasibility. In: Proc. 2nd Int. Conf. on Operational Research (ed. by Banburry and Maitland), English University Press, 1960, pp. 323-328
9. Cuninghame-Green, R.A.: Describing industrial processes with interference and approximating their steady state behaviour. Operational Res. Quarterly 13, 95-100 (1962)
10. Cuninghame-Green, R.A.: Minimax Algebra. Lecture Notes in Economics and Math. Systems 166, Berlin: Springer, 1979
11. Cuninghame-Green, R.A.: The characteristic maxpolynomial of a matrix. J. Math. Analysis and Applications 95, 110-116 (1983)
12. Cuninghame-Green, R.A.: Minimax algebra and applications. In: Advances in Imaging and Electron Physics. Vol. 90, pp. 1-121 (Academic Press, New York, 1995)
13. Cuninghame-Green, R.A., Meier, P.F.J.: An algebra for piecewise-linear minimax problems. Discrete Appl. Math 2, 267-294 (1980)
14. De Schutter, B.: Max-Algebraic System Theory for Discrete Event Systems. PhD thesis, Faculty of Applied Sciences, K.U.Leuven, Leuven, Belgium, ISBN 90-5682-016-8, Feb. 1996 http://dutera.et.tud-elft.nl/deschutt/pub/publications. html
15. Gaubert, S.: Théorie des systèmes linéaires dans les diöides. Thèse. Ecole des Mines de Paris, 1992
16. Gaubert, S., Butković, P., Cuninghame-Green, R.A.: Minimal (max, +) realization of convex sequences. SIAM J. Control and Optimization 36, 137-147 (1998)
17. Gondran, M.: Path algebra and algorithms. Combinatorial programming: methods and applications (Proc. NATO Advanced Study Inst., Versailles, 1974) (ed. by B. Roy). NATO Advanced Study Inst. Ser., Ser. C: Math. and Phys. Sci., 19, Dordrecht: Reidel, 1975, pp. 137-148
18. Gondran M., Minoux, M.: L'indépendance linéaire dans les diöides. Bulletin de la Direction Etudes et Recherches. EDF, Série C 1, 67-90 (1978)
19. Gondran M., Minoux, M.: Linear algebra of diöids: a survey of recent results. Annals of Discrete Mathematics 19, 147-164 (1984)
20. Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. Combinatorica 7, 105-113 (1987)
21. Peteanu, V.: An algebra of the optimal path in networks. Mathematica 9, 335-342 (1967)
22. Robertson, N., Seymour, P.D., Thomas, R.: Permanents, Pfaffian orientations, and even directed circuits. Ann. of Math. (2) 150, 929-975 (1999)
23. Shimbel, A.: Structure in communication nets. Proceedings of the symposium on information networks, New York, April, 1954, pp. 199-203. Polytechnic Institute of Brooklyn, Brooklyn, N.Y., 1955
24. Straubing, H.: A combinatorial proof of the Cayley-Hamilton theorem. Discrete Maths. 43, 273-279 (1983)
25. Zimmermann, U.: Linear and Combinatorial Optimization in Ordered Algebraic Structures. Annals of Discrete Mathematics 10, Amsterdam: North Holland, 1981