Cutting-Planes for Complementarity Constraints

This publication has 9 references indexed in Scilit:

• Edmonds polytopes and a hierarchy of combinatorial problems
  Published by Elsevier ,2002
• A cutting plane algorithm for solving bilinear programs
  Mathematical Programming, 1976
• Two Rules for Deducing Valid Inequalities for 0-1 Problems
  SIAM Journal on Applied Mathematics, 1976
• Polyhedral annexation in mixed integer and combinatorial programming
  Mathematical Programming, 1975
• The Linear Complementarity Problem
  Management Science, 1971
• Convex Analysis
  Published by Walter de Gruyter GmbH ,1970
• Complementary pivot theory of mathematical programming
  Linear Algebra and its Applications, 1968
• Bimatrix Equilibrium Points and Mathematical Programming
  Management Science, 1965
• Equilibrium Points of Bimatrix Games
  Journal of the Society for Industrial and Applied Mathematics, 1964