Skip to main content
SpringerLink
Log in

A Method of Determining a Sequence of the Best Solutions to the Problems of Optimization on Finite Sets and the Problem of Network Reconstruction

  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

A method of determining a sequence of the best solutions to the problems of optimization on finite sets was proposed. Its complexity was estimated by a polynomial of the dimension of problem input, given number of sequence terms, and complexity of completing the design of the original extremal problem. The technique developed was applied to the typical problem of network reconstruction with the aim of increasing its throughput under restricted reconstruction costs.

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

REFERENCES

  1. Emelichev, V.A. and Komlik, V.I., Metod postroeniya posledovatel'nosti planov dlya resheniya zadach diskretnoi optimizatsii (Method of Constructing the Sequence of Plans to Solve the Discrete Optimization Problems), Moscow: Nauka, 1981.

    Google Scholar 

  2. Khachaturov, V.R., Matematicheskie metody regional'nogo programmirovaniya (Mathematical Methods of Regional Programming), Moscow: Nauka, 1981.

    Google Scholar 

  3. Pershin, O.Yu., Polynomial Algorithm to Determine the Given Number of the Best Solutions in the Extremal Problems on Matroids, Avtom. Telemekh., 1999, no. 12, pp. 148–154.

  4. Papadimitrou, Ch. and Steiglitz, K., Combinatorial Optimization: Algorithms and Complexity, Englewood Cliffs: Prentice Hall, 1982. Translated under the title Kombinatornaya optimizatsiya: Algoritmy i slozhnost', Moscow: Mir, 1985.

    Google Scholar 

  5. Babich, O.A. and Pershin, O.Yu., A Method for Calculating the Optimal Variants of Surface Communication Networks at the Stage of Planning Investments into Exploitation of an Oil Deposit. I, Avtom. Telemekh., 1996, no. 11, pp. 105–114.

  6. Ford, L.R., Jr. and Fulkerson, D.R., Flows in Networks, Princeton: Princeton Univ. Press, 1962. Translated under the title Potoki v setyakh, Moscow: Mir, 1966.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia

    O. Yu. Pershin

Authors
  1. O. Yu. Pershin
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pershin, O.Y. A Method of Determining a Sequence of the Best Solutions to the Problems of Optimization on Finite Sets and the Problem of Network Reconstruction. Automation and Remote Control 63, 935–945 (2002). https://doi.org/10.1023/A:1016121806953

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016121806953

Keywords

Search

Navigation