Technical Note—Generalized Covering Relaxation for 0-1 Programs

DOI10.1287/OPRE.28.6.1442MaRDI QIDQ3893670zbMATH OpenOpenAlexFDO

Authors Daniel Granot, Frieda Granot

Publication date 1980

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.28.6.1442

zbMATH Keywords

0-1 polynomial programmingcomputational experiencecutting-plane algorithmgeneralized covering relaxationnested sequence of linear generalized covering problemsrandomly generated problems

Mathematics Subject Classification ID

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

Cited in

(8)

• A search algorithm for the minimum cost covering of 0-1 integers sets
• The basic algorithm for pseudo-Boolean programming revisited
• An algorithm for indefinite integer quadratic programming
• Nonlinear 0–1 programming: I. Linearization techniques
• Nonlinear 0–1 programming: II. Dominance relations and algorithms
• A revised Taha's algorithm for polynomial 0-1 programming
• Concave extensions for nonlinear 0-1 maximization problems
• A dynamic production planning and scheduling algorithm for two products processed on one line

This page was built for publication: Technical Note—Generalized Covering Relaxation for 0-1 Programs

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