Concepedia
Mathematical Programming · 1982 · 15 citations · 4 references
Natural SciencesComputer ScienceMathematicsAlgorithmsOptimizationCombinatorial OptimizationInteger ProgrammingLinear ProgrammingNonlinear ProgrammingConvex RelaxationsCovering ProblemsPolynomial AccelerationPolynomial Optimization
4
An Additive Algorithm for Solving Linear Programs with Zero-One Variables
Egon Balas · Operations Research · 1965 · 705 citations
Natural Sciences, Computer Science, Mathematics +12
The Set-Covering Problem: A New Implicit Enumeration Algorithm
Javier Etcheberry · Operations Research · 1977 · 88 citations
Natural Sciences, Computer Science, Algorithms +16
Covering Relaxation for Positive 0-1 Polynomial Programs
Daniel Granot, Frieda Granot, Jerry Kallberg · Management Science · 1979 · 19 citations
Natural Sciences, Computer Science, Mathematics +16
An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs
Daniel Granot, Frieda Granot, Willem Vaessen · Mathematical Programming · 1982 · 15 citations
Natural Sciences, Computer Science, Mathematics +10