Skip to main content
SpringerLink
Log in

On computational aspects of the realization of local algorithms for solution of problems of discrete optimization

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

Abstract

Results of a computer experiment for a local algorithm in combination with algorithms of the “Dispro” under the solution of quasiblock problems of discrete programming are considered. The use of the relaxation scheme in the local algorithm is given.

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

Literature cited

  1. S. Pissanitski, Technology of Rarefied Matrices [in Russian], Mir, Moscow (1988).

    Google Scholar 

  2. O. A. Shcherbina, “On a unimodular problem of integral programming,” Zh. Vychisl. Mat. Mat. Fiz.,26, No. 7, 1096–1099 (1986).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Simferopol' University, USSR

    E. I. Ilovaiskaya & O. A. Shcherbina

Authors
  1. E. I. Ilovaiskaya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. O. A. Shcherbina
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Dinamicheskie Sistemy, No. 9, pp. 117–122, 1990.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ilovaiskaya, E.I., Shcherbina, O.A. On computational aspects of the realization of local algorithms for solution of problems of discrete optimization. J Math Sci 70, 2043–2046 (1994). https://doi.org/10.1007/BF02110838

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation