Skip to main content
SpringerLink
Log in

Two classes of location problems on tree networks

  • 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. C. Berge, “Balanced matrices,” Math. Program.,2, No. 1, 19–32 (1972).

    Google Scholar 

  2. V. A. Trubin, “On some location problems,” in: Application of Mathematical Methods in Economics and Planning [in Russian], No. 1, Inst. Kibern. Akad. Nauk UkrSSR, Kiev, No. 1 (1968), pp. 3–20.

    Google Scholar 

  3. V. S. Mikhalevich (ed.), Computing Methods for Optimal Planning Decisions [in Russian], Naukova Dumka, Kiev (1977).

    Google Scholar 

  4. V. A. Trubin, “An effective algorithm to solve the location problem on a tree network,” Dokl. Akad. Nauk SSSR,231, No. 3, 547–550 (1976).

    Google Scholar 

  5. T. Saaty, Optimization in Integers and Related Extremal Problems, McGraw-Hill, New York (1970).

    Google Scholar 

Download references

Authors
  1. V. A. Trubin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 4, pp. 84–87, 102, July–August, 1983.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Trubin, V.A. Two classes of location problems on tree networks. Cybern Syst Anal 19, 539–544 (1983). https://doi.org/10.1007/BF01068342

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation