An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs

DOI10.1007/BF01581048zbMath0476.90044MaRDI QIDQ3932587

Daniel Granot, Willem Vaessen, Frieda Granot

Publication date: 1982

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

nonlinear integer programmingcutting planecomputational resultsaccelerated algorithmheuristic solutions0-1 positive polynomial problemslinear set covering problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Boolean programming (90C09)

Related Items

Nonlinear 0–1 programming: II. Dominance relations and algorithms, A revised Taha's algorithm for polynomial 0-1 programming, An exact penalty function approach for nonlinear integer programming problems, Heuristic methods and applications: A categorized survey, An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs, A dynamic programming algorithm for multiple-choice constraints, Univariate parameterization for global optimization of mixed-integer polynomial problems

Cites Work

• Covering Relaxation for Positive 0-1 Polynomial Programs
• An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs
• The Set-Covering Problem: A New Implicit Enumeration Algorithm
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables