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

DOI10.1007/BF01581048MaRDI QIDQ3932587zbMATH OpenFDO

Authors Daniel Granot, Frieda Granot, Willem Vaessen

Publication date 1982

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01581048

zbMATH Keywords

0-1 positive polynomial problemsaccelerated algorithmcomputational resultscutting planeheuristic solutionslinear set covering problemnonlinear integer programming

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(7)

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

This page was built for publication: An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3932587)