Skip to main content
SpringerLink
Log in

Extremal Vector Pairs and Matrices

  • Chapter
Minimax Under Transportation Constrains

Part of the book series: Applied Optimization ((APOP,volume 27))

  • 190 Accesses

Abstract

In this chapter, we consider the integer pairs of vectors that define the classical transportation polyhedron [9]. Feasible solutions of closed transportation problems [7, 27, 36] are taken here from the class of matrices of zeros and ones. Such matrices are used in integer programming [25, 27, 33, 40], in transportation problems [7, 11, 36], in the theory of communication networks [14, 17, 31], and in the theory of automata [16, 24]. For example, in graph theory, such a matrix may play the role of an incidence matrix, adjacency matrix, or a matrix of cycles and cuts [2, 3, 10, 26, 38].

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
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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 to Chapter 4

  1. Aleksandrov P. S., Vvedenie v obshchuyu teoriyu mnozhestv i funktsii ( Introduction to the General Theory of Sets and Functions ), Gostekhteorizdat, 1948.

    Google Scholar 

  2. Busacker R. G. and Saaty T.L., Finite Graphs and Networks: An Introduction with Applications, New York: McGraw-Hill, 1965. Translated under the title Konechnye grafy i seti, Moscow: Nauka, 1974.

    Google Scholar 

  3. Berge C., Theorie des graphes et ses applications, Paris: Dunod, 1958. Translated under the title Teoriya grafov i ee primeneniya, Moscow: Inostr. Literatura, 1962.

    Google Scholar 

  4. Gavrilov G.P. and Sapozhenko A.A., Zadachi i uprazhneniya po kursu diskretnoi matematiki (Problems and Exercises to a Course in Discrete Mathematics), Moscow: Nauka, 1992.

    Google Scholar 

  5. Gale D., A Theorem on Flow in Networks, Pacific J. Math., 1957, vol. 7, pp. 1073–1082.

    Article  MathSciNet  MATH  Google Scholar 

  6. Glazman I.M. and Lyubich Yu.I., Konechnomernyi lineinyi analiz (Finite-Di-mensional Linear Analysis), Moscow: Nauka, 1969.

    Google Scholar 

  7. GoPshtein E.G. and Yudin D.B., Zadachi lineinogo programmirovaniya transportnogo tipa (Transportation Problems in Linear Programming), Moscow: Nauka, 1969.

    Google Scholar 

  8. Dunford N. and Schwartz J.T., Linear Operators, Part 1: General Theory, New York: Interscience, 1958. Translated under the title Lineinye operatory (obshchaya teoriya), Moscow: Mir, 1962.

    Google Scholar 

  9. Emelichev V.A., Kovalev M.M., and Kravtsov M.K., Mnogogranniki, grafy, optimizatsiya (Polyhedrons, Graphs, and Optimization), Moscow: Nauka, 1981.

    Google Scholar 

  10. Zykov A.A., Teoriya konechnykh grafov (Theory of Finite Graphs), Novosibirsk: Nauka, 1969.

    Google Scholar 

  11. Zhuravlev Yu.I., On a Class of Algorithms over Finite Sets, Dokl. Akad. Nauk SSSR, 1963, vol. 151, no. 5, pp. 1025–1028.

    MathSciNet  Google Scholar 

  12. Kaluzhnin L., Vvedenie v obshchuyu algebru (An Introduction to General Algebra), Moscow: Nauka, 1973.

    Google Scholar 

  13. Kelley J. L., General Topology, New York: Van Nostrand, 1957. Translated under the title Obshchaya topologiya, Moscow: Nauka, 1968.

    Google Scholar 

  14. Kleinrock R., Communication Nets: Stochastic Message Flow and Delay, New York: McGraw-Hill, 1964. Translated under the title Kommunikatsionnye seti, Moscow: Nauka, 1970.

    Google Scholar 

  15. Cohn P.M., Free Rings and Their Relations, London: Academic, 1971. Translated under the title Svobodnye kol’tsa i ikh svyazi, Moscow: Mir, 1975.

    Google Scholar 

  16. Melikhov A.N., Orientirovannye grafy i konechnye avtomaty (Directed Graphs and Finite Automata), Moscow: Nauka, 1971.

    MATH  Google Scholar 

  17. Mizin I.A., Urinson L.S., and Khrameshin G.K., Peredacha informatsii v setyakh s kommutatsiei soobshchenii (DataTransmission in Switched Networks), Moscow: Svyaz, 1972.

    Google Scholar 

  18. Mironov A.A., Geometry of the Points in the Space Rn that Can Be Realized in a Graph, Usp. Mat. Nauk, 1977, vol. 32, no. 6, pp. 231–232.

    MathSciNet  MATH  Google Scholar 

  19. Mironov A.A., Readability of a Set of Numbers in a Graph and Properties of Graphs with Prescribed Sets of Degrees, Tr. Gor’kovskogo Gos. Univ., 1981, Markov, A.A., Ed., pp. 76–97.

    Google Scholar 

  20. Mironov A.A., Probabilistic Properties of a Random Graph with Prescribed Set of Degrees of Its Vertices, Izv. Akad. Nauk SSSR, Ser. Tekh. Kibern., 1990, no. 4, pp. 180–188.

    Google Scholar 

  21. Mironov A.A. and Tsurkov V.l., Graphic Representation of Multilevel Hierarchical Structures, Izv. Akad. Nauk SSSR, Ser. Tekh. Kibern., 1991, no. 3, pp. 148–155.

    Google Scholar 

  22. Mironov A.A. and Tsurkov V.l., Approximation and Decomposition by Means of Extremal Graphs, Zh. Vychisl. Mat. Mat Fiz., 1993, vol. 33, no. 2, pp. 283–298.

    MathSciNet  MATH  Google Scholar 

  23. Mironov A.A., Uniform Generalized Graphs, Dokl. Akad. Nauk, 1996, vol. 351, no. 4, pp. 465–468.

    MathSciNet  Google Scholar 

  24. Moisil G.K., Algebraicheskaya teoriya diskretnykh avtomaticheskikh ustroistv (Algebraic Theory of Discrete Automatic Devices), Moscow: Nauka, 1963.

    Google Scholar 

  25. Moder J. and Elmaghraby S.S., Handbook of Operations Research, New York: Van Nostrand, 1978. Translated under the title Issledovanie operatsii. Metodologicheskie osnovy i matematicheskie metody, vol. 1, Moscow: Mir, 1981.

    Google Scholar 

  26. Algoritmy i programmy resheniya zadach na grafakh i setyakh (Algorithms and Programs for Solving Problems on Graphs and Networks), Nechepurenko, M.I., Ed., Novosibirsk: Nauka, 1990.

    Google Scholar 

  27. Propoi A. I., Elementy teorii optimarnykh diskretnykh protsessov (Elements of the Theory of Optimal Discrete Processes), Moscow: Nauka, 1973.

    Google Scholar 

  28. Ryser H. J., Combinatorial Properties of Matrices of Zeros and Ones, Can. J. Math., 1957, vol. 9, pp. 371–377.

    Article  MathSciNet  MATH  Google Scholar 

  29. Ryser H. J., The Term Rank of a Matrix, Can. J. Math., 1958, vol. 10, pp. 57–65.

    Article  MathSciNet  MATH  Google Scholar 

  30. Ryser H. J., Traces of Matrices of Zeros and Ones, Can. J. Math., 1960, vol. 12, pp. 463–476.

    Article  MathSciNet  MATH  Google Scholar 

  31. Teoriya setei svyazi (Theory of Communication Networks), Roginskii V. N., Ed., Moscow: Radio i Svyaz, 1981.

    Google Scholar 

  32. Kombinatornyi analiz. Zadachi i uprazhneniya (Combinatorial Analysis: Problems and Exercises), Rybnikov K. A., Ed., Moscow: Nauka, 1982.

    Google Scholar 

  33. Saaty T., Optimization in Integers and Related Extremal Problems, New York: McGraw-Hill, 1970. Translated under the title Tselochislennye metody optimizat-sii i svyazannye s nimi ekstremal’nye problemy, Moscow: Mir, 1973.

    Google Scholar 

  34. Sachkov V.N., Vvedenie v kombinatornye metody diskretnoi matematiki (An Introduction to Combinatorial Methods of Discrete Mathematics), Moscow: Nauka, 1982.

    Google Scholar 

  35. Sikorski R., Boolean Algebras, Berlin: Springer-Verlag, 1964, 2nd ed. Translated under the title Bulevy algebry, Moscow: Mir, 1969.

    Book  Google Scholar 

  36. Trius E.B., Zadachi matematicheskogo programmirovaniya transportnogo tipa (Transportation Problems in Mathematical Programming), Moscow: Sovetskoe Radio, 1967.

    Google Scholar 

  37. Ford L. R. and Fulkerson D., Flows in Networks, Princeton (New Jersay): Princeton Univ. Press, 1962. Translated under the title Potoki v setyakh, Moscow: Mir, 1966.

    Google Scholar 

  38. Harary F., Graph Theory, Reading (Mass.): Addison-Wesley, 1969. Translated under the title Teoriya grafov, Moscow: Inostr. Literatura, 1963.

    Google Scholar 

  39. Hall M., Jr., Combinatorial Theory, Toronto: Blaisdell, 1967. Translated under the title Kombinatorika, Moscow: Mir, 1970.

    Google Scholar 

  40. Hu T., Integer Programming and Network Flows, Reading (Mass): Addison-Wesley, 1969. Translated under the title Tselochislennoe programmirovanie i potoki v setyakh, Moscow: Mir, 1974.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Center, Russian Academy of Sciences, Moscow, Russia

    Vladimir Tsurkov & Anatoli Mironov

Authors
  1. Vladimir Tsurkov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anatoli Mironov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Tsurkov, V., Mironov, A. (1999). Extremal Vector Pairs and Matrices. In: Minimax Under Transportation Constrains. Applied Optimization, vol 27. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4060-1_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-4060-1_4

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-6818-2

  • Online ISBN: 978-1-4615-4060-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation