Skip to main content
SpringerLink
Log in

Algorithm for solution of the problem of optimum layout of circular patterns with restrictions on the distances between patterns

  • 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

References

  1. S. V. Kantorovich and V. A. Zalgaller, Calculation of Rational Cutting of Industrial Materials [in Russian], Leningrad, 1951.

  2. V. L. Rvachev, “Concerning analytic description of certain geometrical objects,” DAN SSSR, no. 4, 1963.

  3. A. S. Barsov, Linear Programming in Technical-Economic Problems [in Russian], Moscow, 1964.

  4. G. S. Fikhtengol'ts, Differential and Integral Calculus [in Russian], Moscow, 1949.

  5. I. M. Gel'fand and M. L. Tseitlin, “The principle of nonlocal search in automatic optimization systems,” DAN SSSR, no. 2, 1961.

Download references

Authors
  1. V. L. Rvachev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu. G. Stoyan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

23 November 1964

Kibernetika, Vol. 1, No. 3, pp. 77–83, 1965

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rvachev, V.L., Stoyan, Y.G. Algorithm for solution of the problem of optimum layout of circular patterns with restrictions on the distances between patterns. Cybern Syst Anal 1, 79–85 (1965). https://doi.org/10.1007/BF01885707

Download citation

  • Issue Date:

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

Keywords

Search

Navigation