Nonlinear 0–1 programming: I. Linearization techniques

This publication has 12 references indexed in Scilit:

• Nonlinear 0–1 programming: II. Dominance relations and algorithms
  Mathematical Programming, 1984
• Technical Note—Generalized Covering Relaxation for 0-1 Programs
  Operations Research, 1980
• Covering Relaxation for Positive 0-1 Polynomial Programs
  Management Science, 1979
• Methods of Nonlinear 0-1 Programming
  Annals of Discrete Mathematics, 1979
• Facets of the knapsack polytope
  Mathematical Programming, 1975
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
  Operations Research, 1974
• A Balasian-Based Algorithm for Zero-One Polynomial Programming
  Management Science, 1972
• A duality theorem and an algorithm for (mixed-) integer nonlinear programming
  Linear Algebra and its Applications, 1971
• Duality in Discrete Programming: II. The Quadratic Case
  Management Science, 1969
• Letter to the Editor—Reduction of Integer Polynomial Programming Problems to Zero-One Linear Programming Problems
  Operations Research, 1967