Deterministic algorithms for constrained concave minimization: A unified critical survey
Publication:4715980
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6750(199609)43:6<765::AID-NAV1>3.0.CO;2-2" /><765::AID-NAV1>3.0.CO;2-2 10.1002/(SICI)1520-6750(199609)43:6<765::AID-NAV1>3.0.CO;2-2zbMath0857.90099OpenAlexW2089251745MaRDI QIDQ4715980
Publication date: 11 March 1997
Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199609)43:6<765::aid-nav1>3.0.co;2-2
surveybranch-and-boundouter approximationenumerationsuccessive approximationsuccessive partitioningextreme point rankingconcavity cut reductionconstrained concave minimization
Convex programming (90C25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (22)
This page was built for publication: Deterministic algorithms for constrained concave minimization: A unified critical survey