Skip to main content
SpringerLink
Log in
SpringerLink
Log in

References and Notations

  • Chapter
Minimax Algebra

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 166))

  • 77 Accesses

Abstract

In this section, we list in chronological order a number of earlier publications in which the authors develop or consider algebraic structures of the type which form the subject of the present work.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Shimbel, “Structure in communication nets”, Proc. Symp. on Information Networks,Polytechnic Institute of Brooklyn (1954) 119–203.

    Google Scholar 

  2. F.E. Hohn, S. Seshu, and D.D. Aufenkamp, “The theory of nets”, Trans. I.R.E. EC-6 (1957) 154–161.

    Google Scholar 

  3. B. Roy, “Transitivité et connexité”, C.R. Acad. Sci. Paris 249 (1959) 216-218.

    Google Scholar 

  4. R.A. Cuninghame-Green, “Process synchronisation in a steelworks - a problem of feasibility”, in: Banbury and Maitland, ed., Proc. 2nd Int. Conf. on Operational Research (English University Press,1960) 323–328.

    Google Scholar 

  5. B. Giffler, “Mathematical solution of production planning and scheduling problems”, IBM ASDD Technical Report (1960).

    Google Scholar 

  6. M. Yoeli, “ A note on a generalization of boolean matrix theory”, Amer. Math. Monthly 68 (1961) 552–557.

    Article  Google Scholar 

  7. R.A. Cuninghame-Green, “Describing industrial processes with interference and approximating their steady-state behaviour”, Operational Res. Quart. 13 (1962) 95–100.

    Article  Google Scholar 

  8. S. Warshall, “ A theorem on boolean matrices”, J. Assoc.Comput.Mach. 9 (1962) 11–18.

    Article  Google Scholar 

  9. T.S. Blyth, “Matrices over ordered algebraic structures”, J. London Math. Soc. 39 (1964) 427–432.

    Article  Google Scholar 

  10. R.Cruon and Ph. Hervé, “Quelques resultats rélatifs a une structure algébrique et â son application au problème central de l’ordonnancement”, Rev. Francaise Recherche Opérationelle 34 (1965) 3–19.

    Google Scholar 

  11. V. Peteanu, “An algebra of the optimal path in networks”, Mathematica 9 (1967) 335–342.

    Google Scholar 

  12. C. Benzaken, “Structures algébriques des cheminements”, in G. Biorci, ed. Network and Switching Theory (Academic Press, 1968 ) 40–57.

    Google Scholar 

  13. B. Giffler, “Schedule algebra: a progress report”, Naval Res. Logist. Quart. 15 (1968) 255–280.

    Google Scholar 

  14. P. Robert and J. Ferland, “Généralisation de l’algorithme de Warshall, Rev. Francaise Informat. Recherche OpérationeZZe 2 (1968) 71–85.

    Google Scholar 

  15. I. Tomescu, “Sur l’algorithme matriciel de B. Roy”, Rev. Francaise Informat. Recherche Operationelle 2 (1968) 87–91.

    Google Scholar 

  16. P. Brucker, “Verbände stetiger funktionen und kettenwertige homomorphismen”, Math. Ann. 187 (1970) 77-84.

    Google Scholar 

  17. B.A. Carré, “An algebra for network routing problems”, J. Inst. Math. Appl. 7 (1971) 273–294.

    Google Scholar 

  18. P. Brucker, “R-Netzwerke und matrixalgorithmen”, Computing 10 (1972) 271–283.

    Google Scholar 

  19. S. Rudeanu, “On boolean matrix equations”, Rev. Roumaine Math. Pures Appt. 17 (1972) 1075–1090.

    Google Scholar 

  20. D.R. Shier, “A decomposition algorithm for optimality problems in tree-structured networks”, Discrete Math. 6 (1973) 175–189.

    Article  Google Scholar 

  21. E. Minieka and D.R. Shier, “A note on an algebra for the k best routes in a network”, J. Inst. Math. Appl. 11 (1973) 145–149.

    Article  Google Scholar 

  22. M. Gondran, “Algébre des chemins et algorithmes”, NATO conference on combinatorial mathematics (Versailles, 1974)

    Google Scholar 

  23. R.C. Backhouse and B.A. Carré, “Regular algebra applied to path-finding problems”, J. Inst. Math. AppZ. 15 (1975)161–186.

    Google Scholar 

  24. R.A. Cuninghame-Green, “Minimax algebra I: Bands and belts”, Memorandum no. 70, Dept. of Applied Mathematics, T.H. Twente (Netherlands, 1975 ).

    Google Scholar 

  25. R.A. Cuninghame-Green “Projections in minimax algebra”, Math.Prograimning 10 (1976) 111–123.

    Article  Google Scholar 

  26. R. Bellman and W. Karush, “On a new functional transform in analysis: the maximum transform”, Bull. Amer. Math. Soc. 67 (1961) 501–503.

    Google Scholar 

  27. L. Fuchs, Partially Ordered Algebraic Systems (Pergamon, 1963 ).

    Google Scholar 

  28. N.H. McCoy, The Theory of Rings (MacMillan, l964).

    Google Scholar 

  29. D.L. Bentley and K.L. Cooke, “Convergence of successive approximations in the shortest route problem”, J. Math. Anal. Appt. 10 (1965) 269–274.

    Article  Google Scholar 

  30. R.G. Busacker and T.L. Saaty, Finite Graphs and Networks (McGraw Hill, 1965 ).

    Google Scholar 

  31. G.B. Dantzig, “All shortest routes in a graph”, Theory of Graphs (International Symposium, Rome, Z966) (Gordon & Breaeh,l966) 91–92.

    Google Scholar 

  32. M G. Birkhoff, Lattice Theory (American Mathematical Society, 1967 )

    Google Scholar 

  33. N D.J. Wilde and C.S. Beightler, Foundations of Optimization (Prentice-Hall 1967 ).

    Google Scholar 

  34. P.L. Hammer and S. Rudeanu, Boolean Methods in Operations Research (Springer Verlag, 1968 ).

    Google Scholar 

  35. G. Birkhoff and T.C. Bartee, Modern Applied Algebra (McGraw-Hill 1969 ).

    Google Scholar 

  36. K.L. Cooke and E. Halsey, “The shortest route through a network with time-dependent internodal transit”, J. Math. Anal. AppZ. 14 (1969) 493–498.

    Google Scholar 

  37. J.J. Moreau,“Inf-convolution, sous-additivite, convexité des fonctions numériques”, J.Math.Pures App./.49 (1970) 109–154.

    Google Scholar 

  38. R.T. Rockafeller, Convex Analysis (Princeton University,1970)

    Google Scholar 

  39. J.D. Murchland, “Shortest distances between all vertices in a network, and allied problems”, Veröffentlichungen des Instituts fur Stadtbausesen, Heft 7 (Technical University of Braunschweig, 1971 ) 1–24. 250

    Google Scholar 

  40. P. Whittle, Optimization under constraints (Wiley-Interscience 1971 ).

    Google Scholar 

  41. C.M. de Barros “Sur certaines catégories de couples d’applications croissantes”, Math. Nachr. 55 (1972) 151-171.

    Google Scholar 

  42. T.S. Blyth and M.F. Janowitz, Residuation Theory (Pergamon, 1972 ).

    Google Scholar 

  43. A.H.G. Rinnooy Kan, “The machine scheduling problem”, Mathematics Centre (Amsterdam, 1973 ).

    Google Scholar 

  44. L. McLinden “An extension of Fenchel’s duality theorem to saddle functions and dual minimax problems”, Pacific J. Math. 50 (1975)135–158.

    Google Scholar 

  45. A. BrØndsted, “Convexification of conjugate functions”, Math. Scand. 36 (1975) 131–136.

    Google Scholar 

  46. F. Huisman, “Convergentieproblemen in minimax algebra” (Master’s thesis, Twente University of Technology, Netherlands,1975).

    Google Scholar 

  47. R.A. Cuninghame-Green, “Minimax algebra; Part V: Linear dependence” (Technical Report, Birmingham University,1976).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematical Statistics, University of Birmingham, P.O. Box 363, B15 2TT, Birmingham, England

    Prof. Raymond Cuninghame-Green

Authors
  1. Prof. Raymond Cuninghame-Green
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Cuninghame-Green, R. (1979). References and Notations. In: Minimax Algebra. Lecture Notes in Economics and Mathematical Systems, vol 166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-48708-8_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-48708-8_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09113-4

  • Online ISBN: 978-3-642-48708-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation