Skip to main content
SpringerLink
Log in

An extremal problem on random trees

  • 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. W. H. Kohler and K. Steiglitz, “Characterization and theoretical comparison of branch-and-bound algorithms for permutation problems,” J. ACM,21, No. 1, 140–156 (1974).

    Google Scholar 

  2. T. Ibaraki, “Theoretical comparison of search strategies in branch-and-bound algorithms,” Int. J. Comput. Inform. Sci.,5, No. 4, 315–344 (1976).

    Google Scholar 

  3. J. J. Forrest, J. P. Hirst, and J. A. Tomlin, “Practical solution of large mixed integer programming problems with UMPIRE,” Manag. Sci.,20, No. 5, 736–773 (1974).

    Google Scholar 

  4. A. I. Samylovskii, “On economic representation of nonconvex polyhedron,” Paper deposited at VINITI, No. 347-77 Dep. [RZh Mat., No. 5, Ref. 5V651 (1977)].

  5. V. S. Mikhalevich, “Sequential optimization algorithms and their application. I,” Kibernetika, No. 1, 45–56 (1965).

    Google Scholar 

  6. V. S. Mikhalevich, “Sequential optimization algorithms and their application. II,” Kibernetika, No. 2, 85–88 (1965).

    Google Scholar 

Download references

Authors
  1. Yu. P. Laptin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 95–97, March–April, 1981.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Laptin, Y.P. An extremal problem on random trees. Cybern Syst Anal 17, 262–265 (1981). https://doi.org/10.1007/BF01069644

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation