Technical Note—Generalized Covering Relaxation for 0-1 Programs

DOI10.1287/opre.28.6.1442zbMath0447.90062OpenAlexW2007957052MaRDI QIDQ3893670

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

computational experiencecutting-plane algorithmrandomly generated problems0-1 polynomial programminggeneralized covering relaxationnested sequence of linear generalized covering problems

Mathematics Subject Classification ID

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

Related Items

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