Back to search

A finite algorithm for concave minimization over a polyhedron

Data up to Jan 2025

Published1985
Citations59
References21

Total Citations Per Year

Abstract

References (21)

Convex Analysis

1970 • 9,645 citations

Jointly Constrained Biconvex Programming

1983 • 544 citations

An Algorithm for Separable Nonconvex Programming Problems

1969 • 398 citations

A cutting plane algorithm for solving bilinear programs

1976 • 238 citations

Solving the Fixed Charge Problem by Ranking the Extreme Points

1968 • 234 citations

A Successive Underestimation Method for Concave Minimization Problems

1976 • 166 citations

Optimal Facility Location with Concave Costs

1974 • 159 citations

An algorithm for nonconvex programming problems

1976 • 157 citations

Convergent Algorithms for Minimizing a Concave Function

1980 • 125 citations

On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints

1969 • 100 citations

Global Maximization of a Convex Function with Linear Inequality Constraints

1974 • 94 citations

Maximization of A convex quadratic function under linear constraints

1976 • 88 citations

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

1980 • 87 citations

Bilinear programming: An exact algorithm

1977 • 86 citations

Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain

1983 • 75 citations

Quasi-concave minimization subject to linear constraints

1974 • 68 citations

A cutting plane algorithm for the bilinear programming problem

1977 • 55 citations

The bilinear programming problem

1976 • 54 citations

Concave minimization over a convex polyhedron

1973 • 51 citations

Variations on a cutting plane method for solving concave minimization problems with linear constraints

1974 • 47 citations

A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron

1977 • 22 citations

Cited By (0)

Loading...