Skip to main content
SpringerLink
Log in

Topics of polyhedral combinatorics in transportation problems with exclusions

  • Published:
Cybernetics Aims and scope

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. V. A. Emelichev, M. M. Kovalev, and M. K. Kravtsov, Polyhedra, Graphs, and Optimization [in Russian], Nauka, Moscow (1981).

    Google Scholar 

  2. V. A. Emelichev, D. A. Suprunenko, and V. S. Tanaev, “The work of Belorussian mathematicians on discrete optimization,” Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 6, 25–45 (1982).

    Google Scholar 

  3. V. A. Emelichev and M. M. Kovalev, “Polyhedral aspects of discrete optimization,” Kibernetika, No. 6, 54–62 (1982).

    Google Scholar 

  4. V. A. Emelichev and M. K. Kravtsov, “Combinatorial problems on transportation polyhedra,” Ékon. Mat. Metody,19, No. 2, 301–320 (1983).

    Google Scholar 

  5. V. A. Emelichev, M. K. Kravtsov, and A. P. Krachkovskii, “Transportation polyhedra with maximum number of k-faces,” Dokl. Akad. Nauk SSSR,282, No. 4, 784–788 (1985).

    Google Scholar 

  6. V. A. Emelichev, M. K. Kravtsov, and A. P. Krachkovskii, “On solvability of transportation problems with exclusions,” Kibernetika, No. 1, 42–46 (1987).

    Google Scholar 

  7. M. K. Kravtsov and A. D. Korznikov, “Enumerative problems on truncated transporation polyhedra” Izv. Akad. Nauk BSSR, Ser. Fiz.-Mat. Nauk, No. 4, 12–19 (1979).

    Google Scholar 

  8. M. K. Kravtsov, V. A. Emelichev, and V. G. Shilkin, “Transportation polyhedra of special structure,” Vopr. Kibern., No. 64, 29–47 (1980).

    Google Scholar 

  9. M. K. Kravtsov and Yu. I. Kashinskii, “On the structure of the set of feasible solutions of a transportation problem with exclusions,” Vestn. Belorus. Univ., Ser. 1, No. 1, 64–68 (1982).

    Google Scholar 

  10. M. K. Kravtsov and V. A. Istomin, “On the structure of the feasible region of the transportation problem with exclusions,” in: Mathematical Topics in Operations Research [in Russian], NIIEMP Gosplane BSSR, Minsk (1982), pp. 3–19.

    Google Scholar 

  11. A. M. Kononenko and N. N. Trukhanovskii, “Enumeration of maximum trees of one class of bipartite graphs,” Izv. Akad. Nauk BSSR, Ser. Fiz. Mat. Nauk, No. 6, 111–113 (1978).

    Google Scholar 

  12. V. S. Emelicheva, “Enumerative problems on one class of transportation polyhedra,” Dokl. Akad. Nauk BSSR,18, No. 6, 509–511 (1974).

    Google Scholar 

  13. V. A. Emelichev, M. K. Kravtsov, and V. G. Shilkin, “Properties of constraint polyhedra of transportation problems with exclusions,” in: 5th All-Union Conf. on Problems of Theoretical Cybernetics, Abstracts of Papers [in Russian], Novosibirsk (1980), p. 80.

  14. V. Klee, “Convex polyhedra and mathematical programming,” Proc. Inter. Congr. Math., Vancouver (1974).

  15. M. M. Kovalev and A. N. Isachenko, “On constraint polyhedra of the linear programming problem,” Dokl. Akad. Nauk BSSR,22, No. 3, 204–207 (1978).

    Google Scholar 

  16. M. K. Kravtsov, “On the structure of the feasible set of a transportation problem with limited capacities,” Ékon. Mat. Metody,22, No. 3, 524–531 (1986).

    Google Scholar 

  17. V. A. Emelichev, M. K. Kravtsov, and A. P. Krachkovskii, “Minimum number of vertices of a nondegenerate transportation polyhedron with a fixed number of faces,” Dokl. Akad. Nauk BSSR,22, No. 1, 15–17 (1978).

    Google Scholar 

  18. M. K. Kravtsov and V. A. Emelichev, “Some topics of polyhedral combinatorics in generalized transportation problems,” Ékon. Mat. Metody,24, No. 2, 319–326 (1988).

    Google Scholar 

  19. V. A. Emelichev, M. K. Kravtsov, and A. P. Krachkovskii, “On some classes of transportation polyhedra,” Dokl. Akad. Nauk SSSR,241, No. 3, 532–535 (1978).

    Google Scholar 

  20. V. A. Emelichev and M. K. Kravtsov, “On some properties of transportation polyhedra with a maximum number of vertices,” Dokl. Akad. Nauk SSSR,228, No. 5, 1025–1028 (1976).

    Google Scholar 

  21. M. K. Kravtsov, “The radius of the transportation polyhedron,” Izv. Akad. Nauk BSSR, Ser. Fiz.-Mat. Nauk, No. 6, 33–39 (1983).

    Google Scholar 

  22. M. K. Kravtsov, “Maximum-diameter conjecture for the transportation polyhedron,” Dokl. Akad. Nauk BSSR,27, No. 2, 132–134 (1983).

    Google Scholar 

  23. M. K. Kravtsov, “Diameter and radius of the transportation polyhedron,” Dokl. Akad. Nauk SSSR,270, No. 2, 278–281 (1983).

    Google Scholar 

  24. M. K. Kravtsov, “Proof of maximum-diameter conjecture for the transportation polyhedron,” Kibernetika, No. 4, 79–82 (1985).

    Google Scholar 

  25. M. L. Balinski, “The Hirsch conjecture for dual transportation polyhedra,” Math. Oper. Res.,9, No. 4, 397–399 (1984).

    Google Scholar 

  26. N. N. Moiseev, Mathematical Problems of System Analysis [in Russian], Nauka, Moscow (1981).

    Google Scholar 

  27. V. S. Mikhalevich and V. L. Volkovich, Computational Methods and Analysis and Design of Complex Systems [in Russian], Nauka, Moscow (1982).

    Google Scholar 

  28. I. V. Sergienko, Mathematical Models and Methods of Solution of Discrete Optimization Problems [in Russian], Naukova Dumka, Kiev (1985).

    Google Scholar 

  29. V. A. Perepelitsa, A. F. Batishchev, and A. A. Grishin, Mathematical Methods of Agricultural Planning [in Russian], Nauka, Novosibirsk (1970), pp. 103–119.

    Google Scholar 

  30. V. A. Emelichev and V. A. Perepelitsa, “Complexity bounds for multicriterion transportation problems,” Dokl. Akad. Nauk BSSR,30, No. 7, 593–596 (1986).

    Google Scholar 

Download references

Authors
  1. M. K. Kravtsov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 6, pp. 63–71, 84, November–December, 1990.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kravtsov, M.K. Topics of polyhedral combinatorics in transportation problems with exclusions. Cybern Syst Anal 26, 877–891 (1990). https://doi.org/10.1007/BF01069494

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01069494

Keywords

Search

Navigation