Nonlinear 0–1 programming: I. Linearization techniques
Data up to Jan 2025
Total Citations Per Year
Abstract
References (18)
Boolean Methods in Operations Research and Related Areas
1968 • 522 citations
Facets of the knapsack polytope
1975 • 397 citations
Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
1974 • 368 citations
Integer and Non-Linear Programming
1971 • 354 citations
Methods of Nonlinear 0-1 Programming
1979 • 223 citations
Methods of Operations Research
1951 • 183 citations
Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
1973 • 120 citations
L’algebre de Boole et ses applications en recherche operationnelle
1960 • 103 citations
Nonlinear 0–1 programming: II. Dominance relations and algorithms
1984 • 65 citations
A Balasian-Based Algorithm for Zero-One Polynomial Programming
1972 • 43 citations
The Generalized Lattice-Point Problem
1973 • 39 citations
Duality in Discrete Programming: II. The Quadratic Case
1969 • 37 citations
Covering Relaxation for Positive 0-1 Polynomial Programs
1979 • 19 citations
A duality theorem and an algorithm for (mixed-) integer nonlinear programming
1971 • 18 citations
Generalized Covering Relaxation for 0-1 Programs.
1978 • 17 citations
Technical Note—Generalized Covering Relaxation for 0-1 Programs
1980 • 15 citations
On the inversion of a matrix of rational functions
1971 • 13 citations
Deleted Work
1955 • 0 citations