Using convex envelopes to solve the interactive fixed-charge linear programming problem
Data up to Jan 2025
Total Citations Per Year
Abstract
References (13)
Convex Analysis
1970 • 9,645 citations
The Computation of Fixed Points and Applications
1976 • 416 citations
A Successive Underestimation Method for Concave Minimization Problems
1976 • 166 citations
Lagrange Multipliers and Nonconvex Programs
1969 • 103 citations
A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs
1979 • 99 citations
The Direct Power of Adjacent Vertex Programming Methods
1965 • 96 citations
Global Maximization of a Convex Function with Linear Inequality Constraints
1974 • 94 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 finite algorithm for concave minimization over a polyhedron
1985 • 59 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
The interactive fixed charge linear programming problem
1986 • 14 citations