Skip to main content
SpringerLink
Log in

An assignment problem

  • 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. L. R. Ford and D. R. Fulkerson, Flows in Networks, Princeton Univ. Press (1962).

  2. J. D. C. Little, K. G. Murty, D. W. Sweeney, and C. Karel, “An algorithm for the traveling salesman problem,”, Ekon. i Matem. Met.,1, No. 1 (1965).

Download references

Authors
  1. É. I. Volynskii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. K. Vyatkin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. L. A. Krasin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 111–113, March–April, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Volynskii, É.I., Vyatkin, A.K. & Krasin, L.A. An assignment problem. Cybern Syst Anal 9, 317–320 (1973). https://doi.org/10.1007/BF01069089

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation