A cutting plane algorithm for solving bilinear programs
Data up to Jan 2025
Total Citations Per Year
Abstract
References (17)
Equilibrium Points of Bimatrix Games
1964 • 1,252 citations
Integer and Non-Linear Programming
1971 • 354 citations
Two-person nonzero-sum games and quadratic programming
1964 • 152 citations
Equilibrium Points of Bimatrix Games
1964 • 138 citations
A linear max—min problem
1973 • 133 citations
On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
1969 • 100 citations
Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
1970 • 92 citations
Maximization of A convex quadratic function under linear constraints
1976 • 88 citations
Bilinear programming: An exact algorithm
1977 • 86 citations
A method for solving maximum-problems with a nonconcave quadratic objective function
1966 • 71 citations
Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
1973 • 69 citations
Equilibrium Points in Finite Games
1960 • 61 citations
Nonlinear Power of Adjacent Extreme Point Methods in Linear Programming
1957 • 44 citations
The Maximization of a Quadratic Function of Variables Subject to Linear Inequalities
1964 • 19 citations
Computational aspects on the use of cutting planes in global optimization
1971 • 15 citations
Solving Two-Move Games with Perfect Information
1958 • 4 citations
Deleted Work
1955 • 0 citations