Naval Research Logistics Quarterly · 1977 · 56 citations · 21 references
Natural SciencesComputer ScienceAlgorithmsOptimizationCombinatorial OptimizationConstrained OptimizationConvex OptimizationInteger ProgrammingMathematical ProgrammingOptimization TheoryCut AlgorithmsCutting Planes
Abstract In this paper we discuss the properties of a Bilinear Programming problem, and develop a convergent cutting plane algorithm. The cuts involve only a subset of the variables and preserve the special structure of the constraints involving the remaining variables. The cuts are deeper than other similar cuts.
21
Integer and Non-Linear Programming
K. B. Haley, J. Abadie · Operational Research Quarterly (1970-1977) · 1971 · 318 citations