INTRACTABILITY AND ANALYSIS OF HEURISTICS FOR DISCRETE OPTIMIZATION .2.

被引：0
|
作者：
BONDARENKO, VA
机构：
来源：
AUTOMATION AND REMOTE CONTROL | 1993年 / 54卷 / 01期
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This article presents results of qualitative analysis for the basic heuristics used for approximate solution of discrete optimization problems, ''greedy'' algorithms and the method of local search. In particular, it is demonstrated that the ''greedy '' algorithm cannot be improved in the class of heurstics based on ordering of the coordinates of the initial-data vector.
引用
收藏
页码：21 / 26
页数：6
相关论文
共 50 条
12345