Graphs, dioids and semirings: New models and algorithms

Operations Research/ Computer Science Interfaces Series

Volumn 41, Issue , 2008, Pages 1-376

  Gondran, Michel ^a   Minoux, Michel ^b  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b SORBONNE UNIVERSITÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84867231720     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-75450-5     Document Type: Article

References (263)

1. Abdali K. S., Saunders D. B. (1975), Transitive closure and related semiring properties via eliminants, in Backhouse R. C., Carré B. A.
2. Ahuja R. K., Magnanti T. L., Orlin J. B. (eds.) (1993), Network Flows, Prentice Hall, Englewood Cliffs, NJ.
3. Akian M. (1999), "Densities of idempotent measures and large deviations, " Transactions of the American Mathematical Society, 351, 11, pp. 4515-4543.
4. Akian M., Quadrat J., Viot M. (1994), "Bellman processes, " in Cohen G., Quadrat J. P. (eds.), LNC in Control and Information Sciences no. 199: 11th International Conference on Analysis and Optimization of Systems, Springer Verlag, Berlin.
5. Akian M., Bapat R., Gaubert S. (1998), "Asymptotics of the Perron eigenvalue and eigenvector using max-algebra, " C. R. Acad. Sci. Paris, t. 327, série I, pp. 927-932.
6. Akian M., Quadrat J. P., Viot M. (1998), "Duality between probability and optimisation, " in J. Gunawardana (éd.) Idempotency, Cambridge University Press, pp. 331-353.
7. Aleksandrov A. D. (1939), "Almost everywhere existence of the second differential of a convex function and some properties of convex functions, " Leningrad University Annals (Mathematical Series), 37, pp. 3-35 (in russian).
8. Atkin A. O. L., Boros E., Cechlárová K., Peled U. N. (1997), Powers of circulants in bottleneck algebra, Linear Algebra and its Applications, 258, pp. 137-148.
9. Attouch H. (1984), Variational Convergences for Functions and Operators, Pitman, London, 1984.
10. Attouch H., Thera M. (1993), Convergences en analyse multivoque et variationnelle, Matapli, no. 36, Smai, 1993.
11. Attouch H., Wets R. J. B. (1986), Isometries of the Legendre-Fenchel transform, Transactions of the American Mathematical Society, vol. 296, pp. 33-60.
12. Attouch H., Aubin J.-P., Clarke F., Ekeland I. (1989), Analyse non linéaire. Contributions en l'honneur de J. J. Moreau, Gauthiers-Villars, Bordas, Paris.
13. Aubin J. P., Frankowska H. (1990), Set-Valued Analysis, Birkhaüser, Borton, 1990.
14. Auslender A. (1984), "A descent method for nondifferentiable convex programs, " Comptes rendus Acad. Sci. Paris, t. 298, série 1, no. 20, pp. 529-532.
15. Azencott R., Guivarc'h Y., Gundy R. F. (1978), Ecole d'été de Saint-FLour 8, Lectures Notes in Math, Springer Verlag, Berlin, 1978.
16. Baccelli F., Cohen G., Olsder G. J., Quadrat J. P. (1992), Synchronization and Linearity. An Algebra for Discrete Event Systems, Wiley, London, 489 pp.
17. Backhouse R. C., Carré B. A. (1975), Regular algebra applied to path-finding problems, J. Inst. Math. Appl., 15, pp. 161-186.
18. Bako A. (1974), Solution of the multiterminal minimal path problem in a network with gains, in A. Prekopa (ed.), Progress in Operations Research.
19. Bapat R. B. (1995), Permanents, max algebra and optimal assignment, Linear Algebra and its Applications, 226-228, pp. 73-86.
20. Bardi M., Capuzzo-Dolcetta I. (1997), Optimal Control and Viscosity Solutions of Hamilton-Jacobi-Bellman Equations, Birkhäuser.
21. Bardi M., Evans L. F. (1984), "On Hopf's formulas for solutions of Hamilton-Jacobi equations, " Nonlinear Analysis Theory, Methods and Applications, vol. 8, no. 11, pp. 1373-1381.
22. Barles G. (1994), Solutions de viscosité des équations de Hamilton-Jacobi, Mathématiques et Applications, Springer Verlag, Berlin, 1994.
23. Beasley L. B., Pullman N. J. (1988), Semiring rank versus column rank, Linear Algebra and its Applications, 101, pp. 33-48.
24. Bellman R. E. (1958), On a routing problem, Quart. Appl. Math. 16, pp. 87-90.
25. Benzaken C. (1968), Structures algébriques des cheminements: pseudo-treillis, gerbiers de carré nul, in G. Biorci (ed.), Network and Switching Theory, Academic Press, NY, pp. 40-57.
26. Benzecri J. P. (1974), L'Analyse des Données: Tome 1: Taxinomie, Dunod, Paris.
27. Berge C. (1958), La Théorie des graphes et ses applications, Dunod Paris.
28. Berge C. (1959), Espaces topologiques, fonctions multivoques, Dunod, Paris.
29. Berge C. (1970), Graphes et Hypergraphes, Dunod Paris.
30. Berge C. (1972), Balanced Matrices, Mathematical Programming 2, 1, pp. 19-31.
31. Betrema J. (1982), Topologies sur des espaces ordonnés, R. A. I. R. O. Informatique Théorique, vol. 16, no. 2, pp. 165-182.
32. Birkhoff G. (1979), Lattice Theory, Am. Math. Soc. Colloquium Publications, vol. 25, 418 pp.
33. Blyth T., Janowitz M. (1972), Residuation Theory, Oxford, Pergamon Press.
34. Borchardt C. W. (1860), Uber eine der Interpolation entsprechende Darstellung der Eliminations-Resultante, J. Reine Angew. Math, 57, pp. 111-121.
35. Bourlès H. (1994), Semi-cancellable fractions in system theory, IEEE Trans. Automatic Control, vol. 39, no. 10, pp. 2148-2153.
36. Brams G. W. (1983), Réseaux de Petri: Théorie et Pratique, Masson, Paris.
37. Brenier Y. (1989), Un algorithme rapide pour le calcul de la transformée de Legendre-Fenchel discrète, C. R. A. S., no. 308, série I, pp. 587-589.
38. Brualdi R. A., Ryser H. J. (1991), Combinatorial Matrix Theory, Cambridge University Press, 367 pp.
39. Bunks C., Chancelier J. P., Delebecque F., Gomez C. (ed.), Goursat M., Nikoukhah R., Steer S. (1999), Engineering and Scientific Computing with Scilab, Birkhäuser.
40. Burkard R. E. (1977), An algebraic approach to assignment problems, Math. Program., 12, pp. 318-327.
41. Burkard R. E., Cuninghame-Green R. A., Zimmermann U. (1984), Algebraic and combinatorial methods in operations research, Ann. Discrete Math. 19, North-Holland, Amsterdam, 381 pp.
42. Butkovic P., Cechlárová K., Szabó P. (1987), Strong linear independence in bottleneck algebra, Linear Algebra and its Applications. 94, pp. 133-155.
43. Cao Z. Q., Kim K. H., Roush, F. W. (1984), Incline Algebra and Applications, Ellis Horwood, Chichester, Wiley, New York.
44. Carré B. A. (1971), An algebra for network routing problems, J. Inst. Math. Appl., 7, pp. 273-294.
45. Cartier P., Foata D. (1969), Problèmes Combinatoires de Commutation et Réarrangement. Lecture Notes, in Mathematics, 85, Springer Verlag, Berlin.
46. Cayley A. (1854), Sur les déterminantes gauches, Crelle's J., 38, pp. 93-96.
47. Cechlárová K. (1992), Eigenvectors in Bottleneck Algebra, Linear Algebra and its Applications 175, pp. 63-73.
48. Cechlárová K. (1995), Unique solvability of max-min fuzzy equations and strong regularity of matrices over fuzzy algebra, Fuzzy Sets and Systems, vol. 75, 2, pp. 165-177.
49. Cechlárová K. (1996), On the powers of matrices in bottleneck/fuzzy algebra, Linear Algebra Appl. 246, pp. 97-112.
50. Cechlárová K. (2003), Powers of matrices over distributive lattices-a review, Fuzzy Sets and Systems, vol. 138, 3, pp. 627-641.
51. Cechlárová K. and Plávka J. (1996), Linear independence in bottleneck algebras, Fuzzy Sets and Systems, vol. 77, 3, pp. 337-348.
52. Chaiken S. (1982), A combinatorial proof of the all-minors matrix-tree theorem, S. I. A. M. J. Algebraic and Discrete Methods 3, pp. 319-329.
53. Chang, C. C. (1958), Algebraic analysis of many valued logics, Trans. AMS 93, pp. 74-80.
54. Charnes A., Raike W. M. (1966), One-pass algorithms for some generalized network problems, Oper. Research 14, pp. 914-923.
55. Chen W. K. (1976), Applied Graph Theory: Graphs and Electrical Networks, North-Holland, Amsterdam.
56. Choquet G. (1953), "Theory of capacities, " Annales de l'Institut Fourier 5, pp. 131-295.
57. Chrétienne P. (1983), Les Réseaux de Petri Temporisés, Thèse, Université Paris 6.
58. Clifford A. H., Preston G. B. (1961), The Algebraic Theory of Semigroups, vol. 1, Amer. Math. Soc.
59. Clifford A. H., Preston G. B. (1961), The Algebraic Theory of Semigroups, vol. 2, Amer. Math. Soc.
60. Cochet-Terrasson J., Cohen G., Gaubert S., Mc Gettrick M., Quadrat J. P. (1998), "Numerical computation of spectral elements in max-plus algebra, " IFAC conference on system structure and control, Nantes, France.
61. CohenG., Quadrat J. P. (1994) (eds.), 11th International Conference onAnalysis and Optimization of Systems, Discrete Event Systems, Number 199, in Lect. Notes in Control and Inf. Sci., Springer Verlag, Berlin.
62. CohenG., Dubois D., Quadrat J. P., Viot M. (1983), Analyse du comportement périodique de systèmes de production par la théorie des dioïdes, Rapport Technique 191, INRIA, Rocquencourt.
63. Cohen G., Dubois D., Quadrat J. P., Viot M. (1985), Alinear-system theoretic view of discrete event processes and its use for performance evaluation in manufacturing, IEEE Trans. Autom. Control AC-30, 3, pp. 210-220.
64. Cohen G., Moller P., Quadrat J. P., Viot M. (1989), Algebraic tools for the performance evaluation of discrete event systems, I. E. E. E. Proceedings, Special Issue on Discrete Event Systems, 77, no. 1.
65. Collomb P., Gondran M. (1977), Un algorithme efficace pour l'arbre de classification, R. A. I. R. O. Recherche Opérationnelle, vol. 1, pp. 31-49.
66. Crandall M. G., Lions P. L. (1983), Viscosity solutions of Hamilton-Jacobi equations, Trans. Am. Math. Soc. 277, 1983.
67. Crandall M. G., Evans L. C., Lions P. L. (1984), Some properties of viscosity solutions in Hamilton-Jacobi equations, Trans Am. Math. Soc., vol. 282, no. 2, pp. 487-502.
68. Crandall M. G., Ishii H., Lions P. L. (1992), User's guide to viscosity solutions of second order partial differential equations, Bull. Am. Math. Soc., vol. 27, no. 1, pp. 1-67.
69. Crouzeix J.-P. (1977), Contribution à l'étude des fonctions quasiconvexes, Thèse de Doctorat, Université de Clermont-Ferrand II (France), 1977.
70. Cruon R., Herve P. H. (1965), Quelques problèmes relatifs à une structure algébrique et à son application au problème central de l'ordonnancement, Revue Fr. Rech. Op. 34, pp. 3-19.
71. Cuninghame-Green, R. A. (1960), Process synchronisation in a steelworks-a problem of feasibility, in: Banbury and Maitland (eds.), Proc. 2nd Int. Conf. on Operational Research, English University Press, pp. 323-328.
72. Cuninghame-Green R. A. (1962), Describing industrial processes with inference and approximating their steady state behaviour, Operl. Res. Quart. 13, pp. 95-100.
73. Cuninghame-Green R. A. (1976), Projections in a minimax algebra, Math. Progr. 10, pp. 111-123.
74. Cuninghame-Green R. A. (1979), Minimax algebra, lecture notes, in Economics and Mathematical Systems 166, Springer, Berlin, Heidelberg, New York.
75. Cuninghame-Green R. A. (1991), Minimax algebra and applications, Fuzzy Sets and Systems, vol. 41, 3, pp. 251-267.
76. Cuninghame-Green R. A. (1991), Algebraic realization of discrete dynamical systems, Proceedings of the 1991 IFACWorkshop on Discrete Event System Theory and Applications in Manufacturing and Social Phenomena, International Academic Publishers, pp. 11-15.
77. Cuninghame-Green R. A. (1995), Maxpolynomial equations, Fuzzy Sets and Systems, vol. 75, 2, pp. 179-187.
78. Cuninghame-Green R. A., Cechlárová K. (1995), Residuation in fuzzy algebra and some applications, Fuzzy Sets and Systems, 71, pp. 227-239.
79. Cuninghame-Green R. A., Meijer P. F. J. (1980), An algebra for piecewise-linear minimax problems, Discrete Appl. Math. 2, pp. 267-294.
80. Dal Maso G. (1993), An Introduction to Γ-convergence, Birkhäuser.
81. Dantzig G. B. (1966), all shortest routes in a graph, in Théorie des Graphes, Proceedings Int. Symp. Rome, Italy, Dunod, Paris, pp. 91-92.
82. Dantzig G. B., Blattner W. O., Rao M. R. (1967), Finding a cycle in a graph with minimum cost-totime ratio with application to a ship routing problem, in Théorie des graphes, proceedings int. symp. Rome, Italy, Dunod, Paris, pp. 209-214.
83. Dautray R., Lions J. L. (1985), Analyse mathématique et calcul numérique pour les sciences et les techniques, tome 3, Masson, 1985.
84. Defays D. (1978), Analyse hiérarchique des Préférences et généralisations de la transitivité, Math. Sc. Hum., no. 61, pp. 5-27.
85. De Giorgi E. (1975), Sulla converginza di alcune successioni di integrali del tipo dell' area, Rend. Math. (6), 8, 1975, pp. 277-294.
86. De Giorgi E., Marino A., Tosques M. (1980), Problemi di evoluzione in spazi metrici e curve di massina pendenza, Rend. Classe Sci. Fis. Mat. Nat. Accad. Naz. Lincei 68, pp. 180-187.
87. Derigs U. (1979), Duality and admissible transformations in combinatorial optimization, Zeitschrift für Oper. Res., 23, pp. 251-267.
88. Devauchelle-Gach B. (1991), Diagnostic mécanique des fatigues sur les structures soumises à des vibrations en ambiance de travail, Thèse de doctorat, Paris 9 Dauphine.
89. Dijkstra E. W. (1959), ANote on two problems in connection with graphs, Numerische Mathematik 1, pp. 269-271.
90. Di Nola A., Lettieri A., Perfilieva I. and Novák V. (2007), Algebraic Analysis of Fuzzy Systems, Fuzzy Sets and Systems, vol. 158, 1, 1, pp. 1-22.
91. Di Nola A., Gerla B., Algebras of Lukasiewicz's logic and their semirings reducts, in Proc. Conf. on Idempotent Mathematics and Mathematical Physics, to appear.
92. Dodu J. C., Eve T., Minoux M. (1994), "Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results, " Numerical Algorithms, 6, pp. 245-273.
93. Dubois D. (1987), "Algèbres exotiques et ensembles flous. " Séminaire "Algèbres Exotiques et Systèmes à Evénements Discrets, " 3-4 juin 1987, CNET, Issy-les-Moulineaux.
94. Dubois D., Prade H. (1980), Fuzzy Sets and Systems. Theory and Application. Academic Press, New York.
95. Dubois D., Prade H. (1987), Théorie des Possibilités. Application à la Représentation des Connaissances en Informatique, Masson, Paris (2e éd.).
96. Dubois D., Prade H. (1991), Fuzzy sets in approximate reasoning-part1: inference with possibility distributions, Fuzzy Sets and Systems, 40, pp. 143-202.
97. Dubois D., Stecke K. E. (1990), Dynamic analysis of repetitive decision-free discrete event processes: the algebra of timed marked graphs and algorithmic issues, Ann. Oper. Res. 26, pp. 151-193.
98. Dubreil P., Dubreil-Jacotin M. L. (1964), Leçons d'Algèbre Moderne, Dunod, Paris, France.
99. Dudnikov P. L., Samborskii S. N. (1989), Spectra of endomorphisms of semimodules over semirings with an idempotent operation, Soviet Math. Doki., vol. 40, no. 2, pp. 363-366.
100. Eilenberg S. (1974), Automata, Languages and Machines, Academic Press, London.
101. Ekeland I., Teman R. (1974), Analyse convexe et problèmes variationnels, Dunod, Gauthier-Villars, Paris.
102. Elquortobi A. (1992), Inf convolution quasi-convexe des fonctionnelles positives, Recherche opérationnelle/Operations research, vol. 26, no. 4, 1992, pp. 301-311.
103. Fan Z. T. (2000), On the convergence of a fuzzy matrix in the sense of triangular norms, Fuzzy Sets and Systems 109, pp. 409-417.
104. FenchelW. (1949), On the conjugate convex functions, Canadian J. Math., vol. 1, pp. 73-77.
105. Finkelstein A. V., Roytberg M. A. (1993), "Computation of biopolymers: a general approach to different problems, " Bio Systems, 30, pp. 1-20.
106. Fliess M. (1973), "Automates et séries rationnelles non commutatives, " Automata Languages Programming (M. NIVAT éd.), North Holland.
107. Floyd R. W. (1962), Algorithm 97: Shortest Path, Comm. A. C. M. 5, pp. 345.
108. Foata D. (1965), Etude algébrique de certains problèmes d'Analyse Combinatoire et du Calcul des Probabilités, Publ. Inst. Statist. Univ. Paris, 14.
109. Foata D. (1980), Acombinatorial proof of Jacobi's identity, Annals Discrete Maths 6, pp. 125-135.
110. Ford L. R. Jr (1956), Network flow theory, The Rand Corporation, pp. 293.
111. Ford L. R., Fulkerson D. R. (1962), Flows in Networks, Princeton University Press, Princeton.
112. Frobenius G. (1912), "Über Matrizen aus nicht negativen Elementen, " S. B. Deutsch. Akad. Wiss. Berlin. Math.-Nat. K1, pp. 456-477.
113. Gantmacher F. R. (1966), Théorie des matrices, tome 2, Dunod.
114. Gaubert S. (1992), Théorie linéaire des systèmes dans les dioïdes, Thèse de Doctorat, Ecole des Mines, Paris.
115. Gaubert S. (1994), "Rational series over dioids and discrete event systems, " 11th Int. conf. on analysis and optimization of systems: Discrete Event Systems, Number 199, in Lect. Notes in Control and Inf. Sci., Springer Verlag.
116. Gaubert S. (1995a), Performance evaluation of (Max, +) Automata, IEEE Trans. Automatic Control 40 (12), pp. 2014-2025.
117. Gaubert S. (1995b), Resource optimization and (Min, +) Spectral Theory, IEEE Trans. Automatic Control 40 (12), pp. 1931-1934.
118. Gaubert S. (1998), Communication orale à la 26e Ecole de Printemps on Theoretical Computer Science, Noirmoutier.
119. Gaubert S., Gunawardena J. (1998), "The Duality Theorem for Min-Max Functions, " C. R. Acad. Sci. 326, pp. 43-48.
120. Gaubert S., Mairesse J. (1998), Modeling and analysis of timed petri nets using heaps of pieces, IEEE Trans. Automatic Control, à paraître.
121. Gaubert S., Butkovic P., Cuninghame-Green R. (1998), Minimal (Max, +) Realizations of Convex Sequences, SIAM Journal Control Optim. 36, 1, pp. 137-147.
122. Gavalec M. (1997), Computing matrix period in max-min algebra, Discrete Appl. Math. 75, pp. 63-70.
123. Gavalec M. (2002), Monotone eigenspace structure in max-min algebra, Linear Algebra Appl. 345, pp. 149-167.
124. Ghouila-Houri A. (1962), Caractérisation des matrices totalement unimodulaires, C. R. A. S., Paris, tome 254, pp. 1192.
125. Giffler B. (1963), Scheduling general production systems using schedule algebra, Naval Research Logistics Quarterly, vol. 10, no. 3.
126. Golan J. S. (1999), Semirings and Their Applications, Dordrecht, Kluwer Academic Publishers.
127. Gondran M. (1974), Algèbre linéaire et Cheminement dans un Graphe, R. A. I. R. O., vol. 1, pp. 77-99.
128. Gondran M. (1975), L'algorithme glouton dans les algèbres de chemins, Bulletin de la Direction Etudes et Recherches, EDF, Série C, 1, pp. 25-32.
129. Gondran M. (1975a), path algebra and algorithms, in Combinatorial Programming: Methods and Applications (B. Roy Ed.) D. Reidel Publish Co., pp. 137-148.
130. Gondran M. (1976a), Valeurs Propres etVecteurs Propres en Classification Hiérarchique, R. A. I. R. O. Informatique Théorique, 10, 3, pp. 39-46.
131. Gondran M. (1976b), Des algèbres de chemins très générales: les semi-anneaux à gauche et à droite, Note interne EDF 2194/02, unpublished.
132. Gondran M. (1977), Eigenvalues and eigenvectors in hierarchical classification, in: Barra, J. R., et al. (eds.), Recent Developments in Statistics, North Holland, Amsterdam, pp. 775-781.
133. Gondran M. (1979), Les Eléments p-réguliers dans les Dioïdes, Discrete Mathematics 25, pp. 33-39.
134. Gondran M. (1995b), Valeurs Propres et Vecteurs Propres en Analyse des Préférences ou Trois solutions du paradoxe de Condorcet, Note EDF HI-00/95-001.
135. Gondran M. (1996), Analyse MINPLUS, C. R. A. S. Paris, t. 323, série 1, pp. 371-375.
136. Gondran M. (1996b), "Analyse MINMAX, " C. R. Acad. Sci. Paris, 323, série I, pp. 1249-1252.
137. Gondran M. (1998), Inf-sup-ondelettes et analyse multirésolution. Note interne EDF DER HI 1997.
138. Gondran M. (1999a), Analyse MINMAX: infsolutions, infondelettes, infconvergences et analyse quasi-convexe. Note EDF DER HI 1999.
139. k et analyse Min-Plus complexe. C. R. A. S., Paris, t. 329, série I, pp. 783-788.
140. Gondran M. (2001a), "Calcul des variations complexes et solutions explicites d'équations d'Hamilton-Jacobi complexes, " C. R. Acad. Sci. Paris, t. 32, série I, pp. 677-680.
141. Gondran M. (2001b), "Processus complexe stochastique non standard en mécanique quantique, " C. R. Acad. Sci. Paris, série I, pp. 593-598.
142. Gondran M., Minoux M. (1977), Valeurs propres et Vecteurs propres dans les Dioïdes et leur Interprétation en Théorie des Graphes, Bull. Dir. Et. Rech. EDF, Série C, pp. 24-41.
143. Gondran M., Minoux M. (1978), L'indépendance linéaire dans les Dioïdes, Bull. Dir. Et. Rech. EDF, Série C, no. 1, pp. 67-90.
144. Gondran M., Minoux M. (1979), Graphes et Algorithmes, Eyrolles, Paris, 3e édition revue et augmentée 1995.
145. Gondran M., Minoux M. (1979), Valeurs propres et Vecteurs propres en Théorie des graphes, Colloques Internationaux, CNRS Paris 1978, pp. 181-183. Lecture Notes in Econom. and Math. Systems 166, Springer Verlag, Berlin.
146. Gondran M., Minoux M. (1984), Linear Algebra in Dioïds. Asurvey of recent results, in Algebraic and Combinatorial Methods in Operations Research (Burkard R. E., Cuninghame-Green R. A., Zimmermann U. Editors), Annals of Discrete Mathematics 19, pp. 147-164.
147. Gondran M., Minoux M. (1996), Valeurs propres et fonctionnelles propres d'endomorphismes à diagonale dominante en analyse MIN-MAX, C. R. A. S., Paris, t. 325, série 1, pp. 1287-1290.
148. Gondran M., Minoux M. (1998), Eigenvalues and Eigen-Functionals of Diagonally Dominant Endomorphisms in MIN-MAX Analysis, Linear Algebra and its Appl., 282, pp. 47-61.
149. Gondran M., Minoux M. (2007), "Dioids and Semirings: Links to Fuzzy sets and other Applications. " Fuzzy sets and Systems, 158, 12, pp. 1273-1294.
150. Grabisch M. (1995), On equivalence classes of fuzzy connectives. The case of fuzzy integrals, IEEE Trans. on Fuzzy Systems, vol. 3, no. 1, pp. 96-109.
151. Grabisch M. (2003), The symmetric Sugeno integral, Fuzzy Sets and Systems, 139, pp. 473-490.
152. Grabisch M. (2004), "The Möbius function on symmetric ordered structures and its application to capacities on finite sets, " Discrete Math., 287, 1-3, pp. 17-34.
153. Grabisch M., Sugeno (1992), M., Multiattribute classification using fuzzy integral, 1st IEEE Int. Conf. on Fuzzy System, pp. 47-54.
154. Grabisch M., De Baets, B., Fodor, J. (2004), The quest for rings on bipolar scales, Int. J. Uncertainty, Fuzziness and Knowledge-Based Systems, 12, 4, pp. 499-512.
155. Graham S. L., Wegman M. (1976), A fast and usually linear algorithm for global flow analysis, J. l ACM, 23, 1, pp. 172-202.
156. Grossmann A., Morlet J. (1984), "Decomposition of Hardy functions into square integrable wavelets of constant shape, " SIAM J. Math., Amal. 15, pp. 723, 1984.
157. Gunawardena J. (1994), "Min-max functions, " Discrete Event Dynamic Systems, 4, pp. 377-406.
158. Gunawardena J. (1998), Idempotency, Cambridge University Press.
159. Guo S. Z., Wang P. Z., Di Nola A., Sesa S. (1988), Further contributions to the study of finite fuzzy relation equations, Fuzzy Sets and Systems 26, pp. 93-104.
160. Halpern J., Priess I. (1974), Shortest paths with time constraints on movement and parking, Networks, 4, pp. 241-253.
161. Hammer P. L., Rudeanu S. (1968), Boolean Methods in Operations Research, Springer Verlag.
162. Han S. C., Li H. X. (2004), Invertible incline matrices and Cramer's rule over inclines, Linear Algebra and Its Applications 389, pp. 121-138.
163. Hebisch U., Weinert H. J. (1998), Semirings. Algebraic theory and application in computer science, World Scientific, 361 pp.
164. Hille E., Phillips R. S. (1957), Functional Analysis and Semi-groups, American Mathematical Society, vol. XXXI.
165. Hiriart-Urruty J. B. (1998), Optimisation et analyse convexe, PUF, Paris.
166. Hoffman A. J. (1963), On Abstract dual Linear Programs, Naval Research Logistics Quarterly 10, pp. 369-373.
167. Höhle U. H., Klement E. P. (1995), Commutative Residuated 1-monoïds, in Non-classical Logics and Their Applications to Fuzzy Subsets. A Handbook of the Mathematical Foundations of Fuzzy Set Theory, Dordrecht, Kluwer, pp. 53-106.
168. Hopf E. (1965), "Generalized solutions of non linear equations of first-order, " J. Math. Mech., 14, pp. 951-973.
169. Hu T. C. (1961), The maximum capacity route problem, Oper. Res. 9, pp. 898-900.
170. Hu T. C. (1967), Revised matrix algorithms for shortest paths, S. I. A. M. J. Appl. Math., 15, 1, pp. 207-218.
171. Jaffard S. (1989), "Exposants de Hölder en des points donnés et coefficients d'ondelettes, " C. R. Acad. Sci. Paris, 308, série I, pp. 79-81.
172. Johnson, S. C. (1967), Hierarchical clustering schemes, Psychometrica, 32, pp. 241-243.
173. Jun-Sheng Duan J.-S. (2004), The transitive closure, Convergence of powers and adjoint of generalized fuzzy matrices, Fuzzy Sets and Systems, vol. 145, 2, pp. 301-311.
174. Kailath T. (1980), Linear Systems, Prentice Hall, Englewood Cliffs.
175. Kam J. B., Ullman J. D. (1976), Global data flow analysis and iterative algorithms, Journal ACM 23, 1, pp. 158-171.
176. Kam J. B., Ullman J. D. (1977), Monotone data flow analysis frameworks, Acta Informatica 7, pp. 305-317.
177. Karp R. M. (1978), Acharacterization of the minimum cycle mean in a digraph, Discrete Math. 23, pp. 309-311.
178. Kaufmann A., Malgrange Y. (1963), Recherche des chemins et circuits hamiltoniens d'un graphe, R. I. R. O., 26, pp. 61-73.
179. Kelley J. E. (1960), "The cutting-plane method for solving convex programs, " J. l SIAM, 8, pp. 703-712.
180. Kildall G. A. (1973), A Unified approach to program optimization, Conference Rec ACM Symp. on Principles of Programming Languages, Boston, MA, pp. 10-21.
181. Kim K. H., Roush F. W. (1995), Inclines of algebraic structures, Fuzzy Sets and Systems, vol. 72, 2, pp. 189-196.
182. Kim K. H., Roush F. W. (1980), Generalized fuzzy matrices, Fuzzy Sets and Systems 4, pp. 293-315.
183. Kleene S. C. (1956), "Representation of Events in nerve nets and finite automata" in Automata Studies (Shannon & Mc Carthy Editors), Princeton University Press, pp. 3-40.
184. Klement E. P., Mesiar R., Pap E. (2000), Triangular Norms, Dordrecht, Kluwer.
185. Kolokol'tsov V. N., Maslov V. (1989), Idempotent Analysis as a tool of control theory and optimal synthesis, Funktsional'nyi Analiz i Ego Prilozhemiya, vol. 23, no. 1, pp. 1-14, 1989.
186. Kolokol'tsovV. N., MaslovV. (1997), Idempotent Analysis and its Applications, KluwerAcad. Publ.
187. Kuntzmann J. (1972), Théorie des Réseaux, Dunod, Paris.
188. Kwakernaak H., Sivan R. (1972), Linear Optimal Control Systems, Wiley-Interscience, New York.
189. Lallement G. (1979), Semigroups and Combinatorial Applications, J. Wiley & Sons.
190. Laue H. (1988), A Graph Theoretic proof of the fundamental trace identity, Discrete Math 69, pp. 197-198.
191. Lawler E. L. (1967), Optimal Cycles in doubly weighted directed linear graphs, in Théorie des Graphes, Proc. Int. Symp., Rome, Italy, (1966), Dunod, Paris, pp. 209-213.
192. Lax P. D. (1957), "Hyperbolic systems of conservation laws II, " Comm. on Pure and Applied Math., 10, pp. 537-566.
193. Lehmann D. J. (1977), Algebraic structures for transitive closure, Theor. Comput. Sc., 4, pp. 59-76.
194. Lesin S. A., Samborskii S. N. (1992). "Spectra of compact endomorphisms, " in Idempotent Analysis, Maslov and Samborskii Editors, Advances in Soviet Mathematics, vol. 13, American Mathematical Society, pp. 103-118.
195. Li Jian-Xin (1990), The smallest solution of max-min fuzzy equations, Fuzzy Sets and Systems 41, 317-327.
196. Lions P. L. (1982), Generalized solutions of Hamilton-Jacobi Equations, Pitman, London.
197. MacMahon P. A. (1915), Combinatory Analysis, Cambridge University Press et Chelsea Publishing Co., New York, 1960.
198. Mallat S. (1989), A theory of multiresolution signal decomposition: the wavelet representation, IEEE transaction on Pattern Analysis and Machine Intelligence, vol. 2, no. 7.
199. Martinet B. (1970), "Régularisation d'inéquations variationnelles par approximations successives, " RAIRO, 4, pp. 154-159.
200. Maslov V. (1987a), Méthodes opérationnelles, Editions Mir., Moscou, 1987.
201. Maslov V. (1987b), "On a New Principle of Superposition for Optimization Problems, " Russian Math Surveys, 42 (3), pp. 43-54.
202. Maslov V., Samborski S. N. (1992), Idempotent Analysis, Advances in Soviet Mathematics, vol. 13, American Mathematical Society.
203. Mc Lane S., Birkhoff G. (1970), "Algèbre, " Gauthier-Villars, Paris.
204. Menger K. (1942), "Statistical metrics, " Proc. Nat. Acad. Sci. USA, 28; pp. 535-537.
205. Meyer Y. (1992), Les Ondelettes: algorithmes et applications, A. Colin.
206. Minieka E., Shier D. R. (1973), Anote on an algebra for the k best routes in a network, J. Inst. Math. Appl., 11, pp. 145-149.
207. Minoux M. (1975), Plus courts chemins avec contraintes, Annales des Télécommunications 30, no. 11-12, pp. 383-394.
208. Minoux M. (1976), Structures algébriques généralisées des problèmes de cheminement dans les graphes: Théorèmes, Algorithmes et Applications, R. A. I. R. O. Recherche Opérationnelle, vol. 10, no. 6, pp. 33-62.
209. Minoux M. (1977), Generalized path algebras, in Surveys of Mathematical Programming (A. PREKOPA Editor) Publishing House of the Hungarian Academy of Sciences, pp. 359-364.
210. Minoux M. (1982), Linear Dependence and Independence in Lattice Dioïds, Note interne C. N. E. T. non publiée.
211. Minoux M. (1997), Bideterminants, arborescences and extension of the matrix-tree theorem to semirings, Discrete Mathematics, 171, pp. 191-200.
212. Minoux M. (1998a), A generalization of the all minors matrix tree theorem to semirings. Discrete Mathematics 199, pp. 139-150.
213. Minoux M. (1998b), Propriétés combinatoires des matrices sur les (pré-)semi-anneaux, Rapport de Recherche LIP6 1998/050, Université Paris 6.
214. Minoux M. (1998c), Résolution de Systèmes linéaires dans les semi-anneaux et les dioïdes, Rapport de Recherche LIP6 1998/051, Université Paris 6.
215. Minoux M. (1998d), Algèbre linéaire dans les semi-anneaux et les dioïdes, Rapport de Recherche LIP6 1998/052, Université Paris 6.
216. Minoux M. (2001), Extensions of Mac Mahon's master theorem to pre-semi-rings, LinearAlgebra and Appl., 338, pp. 19-26.
217. Moller P. (1987), Notions de rang dans les dioïdes vectoriels, Actes de la Conférence "Algèbres exotiques et systèmes à événements discrets" C. N. E. T., 3-4 juin 1987.
218. Moreau J. J. (1965), "Proximité et dualité dans un espace hilbertien, " Bull. Soc. Math. France, 93, pp. 273-299.
219. Moreau J. J. (1970), Inf-convolution. Convexité des fonctions numériques, J. Math. Pures Appl., 49, pp. 109-154. Morgan, Geometric Measure Theory.
220. Morlet J. (1983), "Sampling Theory andWave Propagation" in: Chen C. H., Acoustic Signal/Image Processing and Recognition, no. 1 in NATO ASi Series. Springer Verlag, pp. 233-261.
221. Nachbin L. (1976), Topology and Order, Van Nostrand, Princeton.
222. Olsder G. J., Roos C. (1988), Cramer and Cayley-Hamilton in the Max-Algebra, Linear Algebra and its Applications, 101, pp. 87-108.
223. Orlin J. B. (1978), Line Digraphs, Arborescences and Theorems of Tutte and Knuth, J. Combin. Theory, B, 25, pp. 187-198.
224. Pap E. (1995), Null-Additive Set Functions, Kluwer, Dordrecht.
225. Perny P., Spanjaard O., Weng P. (2005), "Algebraic Markov decision processes, " Proceedings IJCAI.
226. Perrin D., Pin J. E. (1995), "Semigroups and Automata on infinite words, " in Semi-groups, Formal Languages and Groups, (J. Fountain Editor), Kluwer, Dordrecht, pp. 49-72.
227. Perron O. (1907). "Über Matrizen, " Math. Ann., vol. 64, pp. 248-263.
228. Perterson J. L. (1981), Petri Net Theory and the Modeling of Systems, Prentice Hall, Englewood Cliffs, NJ, 290 pp.
229. Peteanu V. (1967), An algebra of the optimal path in networks, Mathematica, vol. 9, no. 2, pp. 335-342.
230. Quadrat J. P. (1990), Théorèmes asymptotiques en programmation dynamique, C. R. A. S., 311, série I, pp. 745-748.
231. Quadrat J. P., Max-Plus working group (1997), "Min-plus linearity and statistical mechanics, " Markov Processes and Related Fields 3, 4, pp. 565-587.
232. Reutenauer C., Straubing H. (1984), Inversion of matrices over a commutative semiring, J. Algebra, 88, no. 2, pp. 350-360.
233. Robert F., Ferland J. (1968), Généralisation de l'algorithme deWarshall, R. I. R. O. 7, pp. 71-85.
234. RobinsonA. (1973), "Function theory of some nonarchimedean fields, " The American Mathematical Monthly, vol. 80, pp. 87-109.
235. Rockafellar R. T. (1970), Convex Analysis, Princeton University Press, Princeton.
236. Rockafellar R. T. (1976a), "Monotone operators and the proximal point algorithm, " SIAM J. ControlOptimiz., 14, pp. 877-898.
237. Rockafellar R. T. (1976b), "Augmented lagrangians and applications of the proximal point algorithm in convex programming, " Math. Oper. Res. 1, pp. 97-116.
238. Rote G. (1990), Path problems in graphs, Comput. Suppl. 7, pp. 155-189.
239. Roy B. (1975), Chemins et Circuits: Enumérations et optimisation, in Combinatorial Programming: Methods and Applications D. Reidel, Boston, pp. 105-136.
240. Rutherford D. E. (1964), The Cayley-Hamilton theorem for semirings, Proc. R. Soc. Edinburgh Sec. A, 66, pp. 211-215.
241. Salomaa A. (1969), Theory of Automata, Pergamon Press, Oxford.
242. Samborski S. N. (1994), time discrete and continuous control problems convergence of value functions. In 11th Inter. Conf. on Analysis and Optimization of Systems. L. N. in Control and Inf. Sc., no. 199, Springer Verlag, 1994, pp. 297-301.
243. Schweizer B., Sklar A. (1983), Probabilistic Metric Spaces, North Holland, Amsterdam.
244. Shimbel A. (1954), Structure in communication nets, Proc. Symp. on Information Networks, Polytechnic Institute of Brooklyn, pp. 119-203.
245. Simon I. (1994), "On semigroups of matrices over the tropical semiring, " Informatique Théorique et Appl., vol. 28, no. 3-4, pp. 277-294.
246. Spanjaard O. (2003), Exploitation de préférences non classiques dans les Problèmes Combinatoires. Modèles et Algorithmes pour les Graphes, Doctoral dissertation, Université Paris Dauphine, France.
247. Straubing H. (1983), Acombinatorial proof of the Cayley-Hamilton theorem, Discrete Mathematics 43, pp. 273-279.
248. Sugeno M. (1974), Theory of Fuzzy Integrals and Applications, Ph. D. dissertation, Tokyo Institute of Technology.
249. Sugeno M. (1977). "Fuzzy measures and fuzzy integrals. Asurvey, " in Gupta, Saridis, Gaines (eds.), Fuzzy Automata and Decision Processes, pp. 89-102.
250. Tarjan R. E. (1981), A unified approach to path problems, J. A. C. M., vol 28, no. 3, pp. 577-593.
251. Tomescu I. (1966), Sur les méthodes matricielles dans la théorie des réseaux, C. R. Acad. Sci. Paris, Tome 263, pp. 826-829.
252. Tricot C. (1993), Courbes et dimension fractale, Springer Verlag.
253. Tricot C., Quiniou J.-F., Wehbi D., Roques-Carmes C., Dubuc B. (1988), Evaluation de la dimension fractale d'un graphe, Revue Phys. Appl. 23, pp. 111-124.
254. TutteW. T. (1948), The dissection of equilateral triangles into equilateralTriangles, Proc. Cambridge Philos. Soc., 44, pp. 463-482.
255. Volle M. (1985), Conjugaison par tranches, Ann. Mat. Pura Appl. (IV), 1985, 139, pp. 279-312.
256. Wagneur E. (1991), Moduloïds and Pseudomodules 1. Dimension Theory, Discrete Mathematics 98, pp. 57-73.
257. Wang Z., Klir, G. J. (1972), Fuzzy Measure Theory, PlenumPress.
258. Warshall S. (1962), A theorem on boolean matrices, J. A. C. M. 9, pp. 11.
259. Wongseelashote A. (1976), An algebra for determining all path values in a network with application to k-shortest-paths problems, Networks, 6, pp. 307-334.
260. Wongseelashote A. (1979), Semirings and path spaces, Discrete Mathematics 26, pp. 55-78.
261. Yoeli M. (1961), A note on a generalization of Boolean matrix theory, Amer. Math. Monthly, 68, pp. 552-557.
262. Zeilberger D. (1985), A combinatorial approach to matrix algebra, Discrete Mathematics 56, pp. 61-72.
263. Zimmermann U. (1981), Linear and combinatorial optimization in ordered algebraic structures, Annals of Discrete Mathematics 10.