Variations on a cutting plane method for solving concave minimization problems with linear constraints
- 1 June 1974
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 21 (2), 265-274
- https://doi.org/10.1002/nav.3800210206
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The Generalized Lattice-Point ProblemOperations Research, 1973
- Convexity Cuts and Cut SearchOperations Research, 1973
- Intersection Cuts—A New Type of Cutting Planes for Integer ProgrammingOperations Research, 1971
- Computational aspects on the use of cutting planes in global optimizationPublished by Association for Computing Machinery (ACM) ,1971
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme PointsOperations Research, 1970
- An Algorithm for Separable Nonconvex Programming ProblemsManagement Science, 1969
- Solving the Fixed Charge Problem by Ranking the Extreme PointsOperations Research, 1968
- Branch-and-Bound Methods: A SurveyOperations Research, 1966
- Linear Programming and ExtensionsPublished by Walter de Gruyter GmbH ,1963
- Fixed‐cost transportation problemsNaval Research Logistics Quarterly, 1961