A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts

Intersection Cuts—A New Type of Cutting Planes for Integer Programming

Egon Balas · Operations Research · 1971 · 329 citations

Natural Sciences, Computer Science, Mathematics +13

A cutting plane algorithm for solving bilinear programs

Hiroshi Konno · Mathematical Programming · 1976 · 244 citations · Full text

Computing, Computer Science, Algorithms +7

Optimal Facility Location with Concave Costs

Richard M. Soland · Operations Research · 1974 · 165 citations

Natural Sciences, Industrial Engineering, Mathematics +17

Global Maximization of a Convex Function with Linear Inequality Constraints

Philip B. Zwart · Operations Research · 1974 · 95 citations

Natural Sciences, Mathematics, Algorithms +15

Maximization of A convex quadratic function under linear constraints

Hiroshi Konno · Mathematical Programming · 1976 · 89 citations

Natural Sciences, Mathematics, Optimization +9