Skip to main content
SpringerLink
Log in

Optimal location of objects of finite size

  • Optimization and Modeling
  • Published:
Computational Mathematics and Modeling Aims and scope Submit manuscript

Abstract

The location of objects of finite size in a given area is considered. A branch-and-bound algorithm is proposed for the solution of the problem.

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. A. M. Snaksarev, “Optimization of location of technical equipment in flexible production systems”, Stanki i Instrumenty, No. 8, 2–4 (1987).

    Google Scholar 

  2. N. J. Nilson, Principles of Artificial Intelligence, Tioga Pub. Co., Palo Alto, Ca. (1980).

    Google Scholar 

  3. I. I. Melamed, S. I. Sergeev, and I. Kh. Sigal, “Traveling salesman problems. Theoretical issues”, Avtomat. Telemekh., No. 9, 3–33 (1989).

    Google Scholar 

Download references

Authors
  1. A. G. Perevozchikov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. M. Snaksarev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Programmno-apparatnye Sredstva i Matematicheskoe Obespechenie Vychislitel'nykh Sistem, pp. 143–147, 1994.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Perevozchikov, A.G., Snaksarev, A.M. Optimal location of objects of finite size. Comput Math Model 6, 163–166 (1995). https://doi.org/10.1007/BF01138118

Download citation

  • Issue Date:

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

Keywords

Search

Navigation