Skip to main content
SpringerLink
Log in

A class of discrete minimax problems

  • Brief Communications
  • 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. I. V. Romanovskii and N. P. Khristova, “Solution of discrete minimax problems by the dichotomy method,” Zh. Vychisl. Mat. Mat. Fiz., 13, No. 5 (1973).

    Google Scholar 

  2. V. V. Shkurba and S. A. Beletskii, “Numerical methods for the solution of assembly line balancing problems,” Kibernetika, No. 1 (1977).

  3. S. B. Katsev, “Solution of a generalized problem of set decomposition,” Kibernetika, No. 5 (1977).

Download references

Authors
  1. S. B. Katsev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 5, pp. 139–141, September–October, 1979.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Katsev, S.B. A class of discrete minimax problems. Cybern Syst Anal 15, 758–760 (1979). https://doi.org/10.1007/BF01071234

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation