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 条
  • [11] Steepest descent method for solving zero-one nonlinear programming problems
    Anjidani, M.
    Effati, S.
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2007, 193 (01) : 197 - 202
  • [12] An artificial neural network for solving quadratic zero-one programming problems
    Ranjbar, M.
    Effati, S.
    Miri, S. M.
    [J]. NEUROCOMPUTING, 2017, 235 : 192 - 198
  • [13] DIRECT METHODS FOR SOLVING MATHEMATICAL-PROGRAMMING PROBLEMS
    ELSTER, KH
    [J]. EKONOMICKO-MATEMATICKY OBZOR, 1978, 14 (01): : 26 - 36
  • [14] PSO Algorithm with Chaos and Gene Density Mutation for Solving Nonlinear Zero-One Integer Programming Problems
    Gao, Yuelin
    Lei, Fanfan
    Li, Huirong
    Li, Jimin
    [J]. ADVANCES IN SWARM INTELLIGENCE, PT I, 2011, 6728 : 101 - 110
  • [15] FURTHER IMPROVEMENTS IN POLYNOMIAL ZERO-ONE ALGORITHM
    TAHA, HA
    [J]. MANAGEMENT SCIENCE SERIES B-APPLICATION, 1972, 19 (02): : 226 - &
  • [16] A TIGHT LINEARIZATION AND AN ALGORITHM FOR ZERO-ONE QUADRATIC-PROGRAMMING PROBLEMS
    ADAMS, WP
    SHERALI, HD
    [J]. MANAGEMENT SCIENCE, 1986, 32 (10) : 1274 - 1290
  • [17] Solving zero-one mixed integer programming problems using tabu search
    Lokketangen, A
    Glover, F
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 106 (2-3) : 624 - 658
  • [18] SOLVING LARGE-SCALE ZERO-ONE LINEAR-PROGRAMMING PROBLEMS
    CROWDER, H
    JOHNSON, EL
    PADBERG, M
    [J]. OPERATIONS RESEARCH, 1983, 31 (05) : 803 - 834
  • [19] SIMPLIFIED ALGORITHM FOR OBTAINING APPROXIMATE SOLUTIONS TO ZERO-ONE PROGRAMMING PROBLEMS
    TOYODA, Y
    [J]. MANAGEMENT SCIENCE SERIES B-APPLICATION, 1975, 21 (12): : 1417 - 1427
  • [20] Solving zero-one mixed integer programming problems using tabu search
    Molde Coll & Res. Cent Molde, Molde, Norway
    [J]. Eur J Oper Res, 2-3 (624-658):
12345