Cover Image

Асимптотичний підхід до вирішення дискретних екстремальних задач з інтервальними даними

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.

Saved in:
Bibliographic Details
Date:2019
Main Authors: Perepelitsa, V. A., Tereshchenko, Ye. V.
Format: Article
Language:Russian
Published: The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute" 2019
Online Access:http://journal.iasa.kpi.ua/article/view/154693
Tags: Add Tag
No Tags, Be the first to tag this record!
Journal Title:System research and information technologies

Institution

System research and information technologies

Similar Items

Similar Items