Asymptotic approach to solution of discrete extreme problems with interval data

Authors

  • V. A. Perepelitsa
  • Ye. V. Tereshchenko

Abstract

A polynomial two-level algorithm for the linear contraction of criteria for the problem of covering an interval-weighted graph with stars is offered when the objective function tends to a maximum. The sufficient conditions for the asymptotic accuracy of the algorithm is substantiated.

Author Biographies

V. A. Perepelitsa

V.A. Perepelitsa

Ye. V. Tereshchenko

Ye.V. Tereshchenko

Downloads

Issue

No. 4 (2006)

Section

Methods of optimization, optimum control and theory of games

License

This is an open access journal which means that all content is freely available without charge to the user or his/her institution. Users are allowed to read, download, copy, distribute, print, search, or link to the full texts of the articles in this journal without asking prior permission from the publisher or the author. This is in accordance with the BOAI definition of open access.