Skip to main content
SpringerLink
Log in

Optimal location of interconnected facilities on tree networks subject to distance constraints

  • Published:
Computational Mathematics and Mathematical Physics Aims and scope Submit manuscript

Abstract

Optimal location of interconnected facilities on tree networks is considered in the case when some of the nodes of the network contain existing facilities. The distances between the facilities must satisfy maximum constraints. Polynomial algorithms for the solution of this problem are proposed.

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

Similar content being viewed by others

References

  1. G. G. Zabudsky and D. V. Filimonov, “Solution of a Discrete Minimax Location Problem in a Network,” Izv. Vyssh. Uchebn. Zaved., Mat., No. 5, 33–36 (2004).

  2. R. L. Francis, T. J. Lowe, and D. H. Ratliff, “Distance Constraints for Tree Network Multifacility Location Problems,” Oper. Res. 26, 570–595 (1978).

    MathSciNet  Google Scholar 

  3. E. Erkut, R. L. Francis, and A. Tamir, “Distance-Constrained Multifacility Minimax Location Problems on Tree Network,” Networks, No. 22, 37–54 (1992).

  4. E. Erkut, R. L. Francis, T. J. Lowe, and A. Tamir, “Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems,” Oper. Res. 37, 447–461 (1989).

    MathSciNet  Google Scholar 

  5. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, 1982; Mir, Moscow, 1985).

    Google Scholar 

  6. J. C. Picard and D. H. Ratliff, “A Cut Approach to the Rectilinear Distance Facility Location Problem,” Oper. Res. 26, 422–433 (1978).

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Omsk Branch, Siberian Division, Russian Academy of Sciences, ul. Pevtsova 13, Omsk, 644099, Russia

    G. G. Zabudsky

Authors
  1. G. G. Zabudsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © G.G. Zabudsky, 2006, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2006, Vol. 46, No. 3, pp. 395–400.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zabudsky, G.G. Optimal location of interconnected facilities on tree networks subject to distance constraints. Comput. Math. and Math. Phys. 46, 376–381 (2006). https://doi.org/10.1134/S0965542506030043

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0965542506030043

Keywords

Search

Navigation