Quasi-concave minimization subject to linear constraints
- 1 July 1974
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 9 (1) , 35-59
- https://doi.org/10.1016/0012-365x(74)90070-3
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The fractional fixed-charge problemNaval Research Logistics Quarterly, 1971
- An approximative algorithm for the fixed charge problemNaval Research Logistics Quarterly, 1969
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear ConstraintsOperations Research, 1969
- Solving the Fixed Charge Problem by Ranking the Extreme PointsOperations Research, 1968
- An approximate solution method for the fixed charge problemNaval Research Logistics Quarterly, 1967
- A method for solving maximum-problems with a nonconcave quadratic objective functionProbability Theory and Related Fields, 1966
- Integer Programming: Methods, Uses, ComputationsManagement Science, 1965
- An approximative algorithm for the fixed‐charges transportation problemNaval Research Logistics Quarterly, 1962
- An Algorithm for Finding All Vertices of Convex Polyhedral SetsJournal of the Society for Industrial and Applied Mathematics, 1961
- Fixed‐cost transportation problemsNaval Research Logistics Quarterly, 1961