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 条

[1] Efficient Solutions for Special Zero-One Programming Problems
Ariela Bilitzky
Arik Sadeh
Journal of Combinatorial Optimization, 2005, 10 : 227 - 238
[2] FURTHER REDUCTION OF ZERO-ONE POLYNOMIAL PROGRAMMING PROBLEMS TO ZERO-ONE LINEAR PROGRAMMING PROBLEMS
GLOVER, F
WOOLSEY, E
OPERATIONS RESEARCH, 1973, 21 (01) : 156 - 161
[3] APPROXIMATING ZERO-ONE PROGRAMMING PROBLEMS
PARSONS, JA
JOURNAL OF SYSTEMS MANAGEMENT, 1976, 27 (04): : 42 - 43
[4] SIMPLIFIED ALGORITHM FOR OBTAINING APPROXIMATE SOLUTIONS TO ZERO-ONE PROGRAMMING PROBLEMS
TOYODA, Y
MANAGEMENT SCIENCE SERIES B-APPLICATION, 1975, 21 (12): : 1417 - 1427
[5] MEASURING THE QUALITY OF APPROXIMATE SOLUTIONS TO ZERO-ONE PROGRAMMING-PROBLEMS
ZEMEL, E
MATHEMATICS OF OPERATIONS RESEARCH, 1981, 6 (03) : 319 - 332
[6] Continuous Reformulations for Zero-One Programming Problems
De Santis, M.
Rinaldi, F.
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2012, 153 (01) : 75 - 84
[7] ZERO-ONE PROGRAMMING
PADBERG, MW
OPERATIONS RESEARCH, 1975, 23 (04) : 833 - 837
[8] Convergence of a continuous approach for zero-one programming problems
Li, Yanyan
Tan, Tao
Li, Xingsi
APPLIED MATHEMATICS AND COMPUTATION, 2011, 217 (09) : 4691 - 4698
[9] REDUCTION OF INTEGER POLYNOMIAL PROGRAMMING PROBLEMS TO ZERO-ONE LINEAR PROGRAMMING
WATTERS, LJ
OPERATIONS RESEARCH, 1967, 15 (06) : 1171 - &
[10] ZERO-ONE HYPERBOLIC PROGRAMMING
FLORIAN, M
ROBILLARD, P
REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1971, 5 (NV1): : 3 - 9

← 1 2 3 4 5 →