A HYBRID ALGORITHM FOR SOLVING POLYNOMIAL ZERO-ONE MATHEMATICAL-PROGRAMMING PROBLEMS

被引：5

作者：

SNYDER, WS ^{[1
]}

CHRISSIS, JW ^{[1
]}

机构：

[1] USAF,INST TECHNOL,DEPT OPERAT SCI,WRIGHT PATTERSON AFB,OH 45433

来源：

IIE TRANSACTIONS | 1990年 / 22卷 / 02期

关键词：

D O I：

10.1080/07408179008964168

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

This paper presents analgorithm for solving large-scale polynomial (nonlinear) zero-one programming problems. The procedure incorporates a mixture of pseudo-Boolean concepts and time-proven implicit enumeration procedures. Significant savings in the time required to obtain optimal solutions results from the use of a minimum cover to analyze the future effect of a particular implicit enumeration iteration. Additional improvement is obtained through the use of a term ranking strategy to control the arborization of the implicit enumeration process. Computational experience demonstrates that this algorithm can reduce the magnitude of the computer solution time for large problems from several minutes to a matter of a few seconds. © 1990 Taylor & Francis Group, LLC.

引用

页码：161 / 167

页数：7

共 50 条

[21] Continuous Reformulations for Zero-One Programming Problems
De Santis, M.
Rinaldi, F.
[J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2012, 153 (01) : 75 - 84
[22] A NONLINEAR ZERO-ONE COMBINATORIAL, GOAL-PROGRAMMING MODEL AND CONSTRUCTIVE ALGORITHM FOR SOLVING MULTIOBJECTIVE ASSIGNMENT PROBLEMS
LIPSKE, KR
FLETCHER, JH
[J]. AT&T BELL LABORATORIES TECHNICAL JOURNAL, 1984, 63 (04): : 665 - 677
[23] ZERO-ONE PROGRAMMING
PADBERG, MW
[J]. OPERATIONS RESEARCH, 1975, 23 (04) : 833 - 837
[24] BRANCH-AND-BOUND ALGORITHM FOR ZERO-ONE MIXED INTEGER PROGRAMMING PROBLEMS
DAVIS, RE
KENDRICK, DA
WEITZMAN, M
[J]. OPERATIONS RESEARCH, 1971, 19 (04) : 1036 - &
[25] A continuous approach for globally solving linearly constrained quadratic zero-one programming problems
Le, THA
Tao, PD
[J]. OPTIMIZATION, 2001, 50 (1-2) : 93 - 120
[26] Efficient Solutions for Special Zero-One Programming Problems
Ariela Bilitzky
Arik Sadeh
[J]. Journal of Combinatorial Optimization, 2005, 10 : 227 - 238
[27] AN APPROACH TO OBTAINING GLOBAL EXTREMUMS IN POLYNOMIAL MATHEMATICAL-PROGRAMMING PROBLEMS
SHOR, NZ
[J]. CYBERNETICS, 1987, 23 (05): : 695 - 700
[28] A STOCHASTIC ALGORITHM FOR ZERO-ONE PROGRAMMING WITH LINEAR FUNCTION
MARTINEC, I
[J]. EKONOMICKO-MATEMATICKY OBZOR, 1990, 26 (04): : 424 - 432
[29] Efficient solutions for special zero-one programming problems
Bilitzky, A
Sadeh, A
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2005, 10 (03) : 227 - 238
[30] SOLVING A ZERO-ONE INTEGER LINEAR-PROGRAMMING PROBLEM
PATEL, HM
[J]. INDUSTRIAL ENGINEERING, 1989, 21 (03): : 49 - 51

← 1 2 3 4 5 →