A cutting plane algorithm for the bilinear programming problem

This publication has 15 references indexed in Scilit:

• Polyhedral annexation in mixed integer and combinatorial programming
  Mathematical Programming, 1975
• Polyhedral convexity cuts and negative edge extensions
  Mathematical Methods of Operations Research, 1974
• Convexity cuts for multiple choice problems
  Discrete Mathematics, 1973
• Polaroids: A new tool in non‐convex and in integer programming
  Naval Research Logistics Quarterly, 1973
• Cutting planes for programs with disjunctive constraints
  Journal of Optimization Theory and Applications, 1973
• Integer programming and convex analysis: Intersection cuts from outer polars
  Mathematical Programming, 1972
• Elements of Large-Scale Mathematical Programming Part I: Concepts
  Management Science, 1970
• A Method for Solving the Indefinite Quadratic Programming Problem
  Management Science, 1970
• A method for solving maximum-problems with a nonconcave quadratic objective function
  Probability Theory and Related Fields, 1966
• The Maximization of a Quadratic Function of Variables Subject to Linear Inequalities
  Management Science, 1964