A cutting plane algorithm for the bilinear programming problem
Data up to Jan 2025
Total Citations Per Year
Abstract
References (22)
Introduction to Operations Research
1968 • 3,466 citations
Nonlinear Programming: A Unified Approach.
1970 • 1,066 citations
Disjunctive programming: Properties of the convex hull of feasible points
1998 • 434 citations
Integer and Non-Linear Programming
1971 • 354 citations
Intersection Cuts—A New Type of Cutting Planes for Integer Programming
1971 • 332 citations
Elements of Large-Scale Mathematical Programming Part I: Concepts
1970 • 258 citations
Introduction to Operations Research
1975 • 114 citations
Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
1970 • 92 citations
Convexity Cuts and Cut Search
1973 • 84 citations
A method for solving maximum-problems with a nonconcave quadratic objective function
1966 • 71 citations
Integer programming and convex analysis: Intersection cuts from outer polars
1972 • 56 citations
The bilinear programming problem
1976 • 54 citations
Polyhedral annexation in mixed integer and combinatorial programming
1975 • 45 citations
Hypercylindrically Deduced Cuts in Zero-One Integer Programs
1971 • 38 citations
Polyhedral convexity cuts and negative edge extensions
1974 • 35 citations
Cutting planes for programs with disjunctive constraints
1973 • 33 citations
Concave Programming Applied to a Special Class of 0-1 Integer Programs
1973 • 29 citations
The Maximization of a Quadratic Function of Variables Subject to Linear Inequalities
1964 • 19 citations
A Method for Solving the Indefinite Quadratic Programming Problem
1970 • 19 citations
Convexity cuts for multiple choice problems
1973 • 16 citations
Polaroids: A new tool in non‐convex and in integer programming
1973 • 13 citations
Deleted Work
1955 • 0 citations