Algorithm for Finding Guaranteed Solution in Knapsack Problem

被引：0
|
作者：
Mammadov, Knyaz [1 ]
Mammadov, Nazim [1 ]
机构：
[1] ANAS, Inst Cybernet, Baku, Azerbaijan
来源：
2012 IV INTERNATIONAL CONFERENCE PROBLEMS OF CYBERNETICS AND INFORMATICS (PCI) | 2012年
关键词：
Knapsack problem; suboptimal solution; guaranteed solution; guaranteed suboptimal solution; computing experiments;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
In the paper, an algorithm for finding the guaranteed suboptimal solution of the 0-1 variable knapsack problem is given. A program on this algorithm was composed, comprehensive and comparative calculating experiments were done.
引用
收藏
页数：5
相关论文
共 50 条
12345