Efficient solutions for special zero-one programming problems

被引：8
|
作者：
Bilitzky, A
Sadeh, A
机构：
[1] Holon Acad Inst Technol, Dept Management Technol, IL-58102 Holon, Israel
[2] Coll Management, Sch Business Adm, Rishon Leziyyon, Israel
来源：
JOURNAL OF COMBINATORIAL OPTIMIZATION | 2005年 / 10卷 / 03期
关键词：
zero-one programming; linear relaxation; combinatorial optimization;
D O I：
10.1007/s10878-005-4104-6
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
A zero-one linear programming is under consideration. It has been proved that for special structures and values of the parameters, the solution of the linear relaxation of the problem is integral and can be either predetermined or computed efficiently. In general, a tight upper bound is provided in order to establish an efficient procedure for solving the problem. The results may have practical implementations in knowledge-management, data-mining, network flow, graph theory, reliability and statistical studies.
引用
收藏
页码：227 / 238
页数：12
相关论文
共 50 条
12345