Skip to main content
SpringerLink
Log in

Effective algorithm for the weber problem with a rectangular metric

  • 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. R. M. Karp, “Convergence of combinatorial problems” Cybernetic Collection [Russian translation], New Series, No. 12, Mir, Moscow (1975).

    Google Scholar 

  2. G. M. Adel'son-Vel'skii, E. A. Dinits, and A. V. Karzanov, Flux Algorithms [in Russian], Nauka, Moscow (1975).

    Google Scholar 

  3. G. O. Wesolowsky and R. F. Love, “A nonlinear approximation method for solving a generalized rectangular distance Weber problem,” Manage. Sci.,18, No. 11 (1972).

  4. H. Juel and R. F. Love, “An efficient computational procedure for solving the multifacility rectilinear facilities location problem,” Oper. Res. Q.,27, No. 3 (1976).

  5. L. R. Ford, Jr., and D. R. Fulkerson, Flows in Networks, Princeton (1962).

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. 6, pp. 67–70, November–December, 1978.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Trubin, V.A. Effective algorithm for the weber problem with a rectangular metric. Cybern Syst Anal 14, 874–878 (1978). https://doi.org/10.1007/BF01070282

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation