A Hybrid Algorithm for Solving Polynomial Zero-One Mathematical Programming Problems

REFERENCES

• Balas , Egon ; “ An additive Algorithm for Solving Linear Programs with Zero-One Variables ,” Operations Research , Vol. 13 , No. 4 , pp. 517 – 546 , Jul-Aug , 1965 .
   Web of Science ®Google Scholar
• Chrissis , James W .; “The Solution of Nonlinear Pseudo-Boolean Op timization Problems Subject to Linear Constraints,” Doctoral Dissertation , Virginia Polytechnic Institute and State University , Blacksburg , Virginia , 1980 .
   Google Scholar
• Glover , Fred ; and Woolsey , R. E .; “ Further Reduction of Zero-One Polynomial Programming Problems to Zero-One Linear Programming Problems ,” Operations Reseurch , Vol. 21 , No. 1 , ( Jan-Feb , 1973 ), pp. 156 – 161 .
   Web of Science ®Google Scholar
• Glover , Fred ; and Woolsey , R. E .; “ Converting the 0–1 Polynomial Programming Problem to a 0–1 Linear Program ,” Operations Research. Vol. 22 , No. 1 , ( Jan-Feb , 1974 ), pp. 141 – 161 .
   Web of Science ®Google Scholar
• Granot , Daniel ; Granot , Frieda ; and Vaessen , William ; “ An Accelerated Covering Relaxation Algorithm for Solving 0–1 Positive Polynomial Programs ,” Mathematical Programming , Vol. 22 , No. 3 , ( April , 1982 ), pp. 350 – 357 .
   Web of Science ®Google Scholar
• Hammer , Peter L .; “ Boolean Procedures for Bivalent Programming ,” Mathematical Programming in Theory and Practice , North Holland Publishing Co. , Amsterdam , 1974 , pp. 311 – 363 .
   Google Scholar
• Lawler , E. L .; and Bell , M. D .; “ A Method for Solving Discrete Optimiration Problems ,” Operations Reseurch , Vol. 14 , No. 6 ,( Nov-Dec , 1966 ) pp, 1098 – 1112 .
   Web of Science ®Google Scholar
• Sakamoto , Hiroo ; “A Study of Computational Techniques for Zero-One Polynomial Programming,” Doctoral Dissertation , University of Arkansas , Fayetteville , Arkansas , 1977 .
   Google Scholar
• Snyder , Walter S .; “ A Hybrid Algorithm for Solving Polynomial Zero-One Mathematical Programming Problems,” Doctoral Dissertation , University of South Florida , Tampa , Florida , 1984 .
   Google Scholar
• Taha , Hamdy A .; “ A Balasian-based Algorithm for Zero-One Polynomial Programming ,” Management Science , Vol. 18 , No. 6 , pp. B 328 – 343 , Feb. , 1972 .
   Web of Science ®Google Scholar
• Taha , Hamdy A .; “ Further Improvements in the Polynomial Zero-One Algorithm ,” Management Science , Vol, 19 , No. 2 , pp, B 226 – 227 , Oct. , 1972 .
   Web of Science ®Google Scholar
• Watters , L. J .; “ Reduction of Integer Polynomial Problems to Zero-One Linear Programming Problems ,” Operations Research , Vol. 15 , NO. 6 , ( Nov-Dec , 1981 ), pp. 1171 – 1174 .
   Web of Science ®Google Scholar
• Handled by the Department of Applied Optimization.
   Google Scholar