Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Choice of an Optimal Set of Geotechnical Jobs at Oil Fields: Models and Algorithms
Automation and Remote Control
Hi-index | 0.00 |
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.