Covering Relaxation for Positive 0-1 Polynomial Programs
From MaRDI portal
Publication:3205016
DOI10.1287/mnsc.25.3.264zbMath0415.90058OpenAlexW2154549480MaRDI QIDQ3205016
Daniel Granot, Jerry Kallberg, Frieda Granot
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
relaxationcomputational studyimplicit enumerationcutting-plane algorithmrandom test problemsnon-negative coefficientsalgorithmic performancelinear covering problempolynomial constraintpositive 0-1 polynomial program
Specification and verification (program logics, model checking, etc.) (68Q60) Boolean programming (90C09)
Related Items
An ordering (enumerative) algorithm for nonlinear \(0-1\) programming, 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 exact penalty function approach for nonlinear integer programming problems, An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs
