Skip to main content
SpringerLink
Log in

Branch and bound method for a parallel sequencing problem

  • Published:
Journal of Soviet Mathematics Aims and scope Submit manuscript

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. T. A. Tushkina and K. V. Shakbazyan, “On the fundamental concepts of parallel sequencing,” Zap. Nauchn. Seminarov LOMI Akad. Nauk SSSR,18, 6–15 (1970).

    Google Scholar 

  2. J. D. C. Little, K. G. Murty, D. W. Sweeney, and C. Karel, “An algorithm for the travelling salesman problem,” Operat. Res.,11, No. 6 (1963).

  3. V. N. Burkov and S. E. Lovetskii, “Methods for solving extremal combinatorial problems,” Izv. Akad. Nauk SSSR, Tekhn. Kibernet.,4, 82–93 (1968).

    Google Scholar 

  4. V. F. Turchin, “Programming in the REFAL language,” Preprint, Inst. Prikl. Matem. Akad. Nauk SSSR (1971).

  5. V. F. Turchin, “Meta-algorithmic language,” Kibernetika,4, 45–54 (1968).

    Google Scholar 

Download references

Authors
  1. K. V. Shakhbazyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. A. Tushkina
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 35, pp. 146–155, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shakhbazyan, K.V., Tushkina, T.A. Branch and bound method for a parallel sequencing problem. J Math Sci 7, 111–119 (1977). https://doi.org/10.1007/BF01846080

Download citation

  • Issue Date:

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

Keywords

Search

Navigation