Skip to main content
SpringerLink
Log in

Quadratic optimization on combinatorial sets in Rn

  • Systems Analysis
  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

We consider the optimization of quadratic functions on the set of permutations in Rn. Extremal properties of these functions are studied. Branch-and-bound methods are proposed for the solution of these optimization problems.

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. V. A. Emelichev, M. M. Kovalev, and M. K. Kravtsov, Polyhedra, Graphs, and Optimization [in Russian], Nauka, Moscow (1981).

    Google Scholar 

  2. Yu. G. Stoyan and S. V. Yakovlev, Mathematical Models and Optimization Methods of Geometical Design [in Russian], Naukova Dumka, Kiev (1986).

    Google Scholar 

  3. A. Brenstetz, An Introduction to the Theory of Convex Polyhedra [Russian translation], Mir, Moscow (1988).

    Google Scholar 

  4. M. M. Kovalev, A. N. Isachenko, and Nguen Ngia, "Linearization of combinatorial optimization problems," Dokl. Akad. Nauk BSSR,22, No. 10, 869–872 (1978).

    Google Scholar 

  5. M. F. Kaspshitskaya, "On local extrema of discrete functions," Dokl. Akad. Nauk UkrSSR, Ser. A, No. 3, 66–69 (1984).

    Google Scholar 

  6. D. A. Suprunenko and N. N. Metel'skii, "Assignment problems and minimization of the sum of linear forms on a symmetric group," Kibernetika, No. 3, 64–68 (1973).

    Google Scholar 

  7. D. A. Suprunenko, V. S. Aizenshtat, and N. A. Lepeshinskii, "Extremal values of functions on permutation sets," Abstracts of papers at 1st All-Union Conf. on Operations Research, Minsk (1972), pp. 61–67.

  8. Yu. G. Stoyan and S. V. Yakovlev, "Properties of convex functions on a permutation polyhedron," Dokl. Akad. Nauk UkrSSR, Ser. A, No. 3, 69–72 (1988).

    Google Scholar 

  9. S. V. Yakovlev, "Bounds on the minimum of convex functions in Euclidean combinatorial spaces," Kibernetika, No. 3, 83–87 (1989).

    Google Scholar 

  10. J. G. Rau, "Minimizing a function of permutations of an integer," Oper. Res.,19, No. 1, 237–240 (1971).

    Google Scholar 

  11. A. A. Bolotnikov, "On the best balancing of a disk with a distribution of peripheral masses," Probl. Mashinostr., No. 6, 68–74 (1978).

    Google Scholar 

  12. V. A. Selyutin, Computer Design of Electronic Devices [in Russian], Sovetskoe Radio, Moscow (1977).

    Google Scholar 

Download references

Authors
  1. Yu. G. Stoyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. V. Yakovlev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. O. V. Parshin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 97–104, July–August, 1991.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stoyan, Y.G., Yakovlev, S.V. & Parshin, O.V. Quadratic optimization on combinatorial sets in Rn . Cybern Syst Anal 27, 561–567 (1991). https://doi.org/10.1007/BF01130367

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation