Covering Relaxation for Positive 0-1 Polynomial Programs

DOI10.1287/MNSC.25.3.264zbMATH Open0415.90058OpenAlexW2154549480MaRDI QIDQ3205016FDOQ3205016

Authors: Daniel Granot, Frieda Granot, Jerry Kallberg 

Publication date: 1979

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.25.3.264

zbMATH Keywords

implicit enumerationrelaxationcomputational studycutting-plane algorithmrandom test problemsnon-negative coefficientsalgorithmic performancelinear covering problempolynomial constraintpositive 0-1 polynomial program

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Boolean programming (90C09)

Cited In (7)

• An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs
• An exact penalty function approach for nonlinear integer programming problems
• Nonlinear 0–1 programming: I. Linearization techniques
• Nonlinear 0–1 programming: II. Dominance relations and algorithms
• Maximum weight archipelago subgraph problem
• A revised Taha's algorithm for polynomial 0-1 programming
• An ordering (enumerative) algorithm for nonlinear \(0-1\) programming

This page was built for publication: Covering Relaxation for Positive 0-1 Polynomial Programs

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