An algorithm for indefinite integer quadratic programming

This publication has 22 references indexed in Scilit:

• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
  Management Science, 1986
• Nonlinear 0–1 programming: II. Dominance relations and algorithms
  Mathematical Programming, 1984
• Nonlinear 0–1 programming: I. Linearization techniques
  Mathematical Programming, 1984
• Technical Note—Generalized Covering Relaxation for 0-1 Programs
  Operations Research, 1980
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
  Management Science, 1975
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
  Operations Research, 1974
• Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
  Operations Research, 1973
• Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
  Operations Research, 1970
• Duality in Discrete Programming: II. The Quadratic Case
  Management Science, 1969
• An Algorithm for Separable Nonconvex Programming Problems
  Management Science, 1969