Taha, Hamdy A. Concave minimization over a convex polyhedron. (English) Zbl 0286.90052 Nav. Res. Logist. Q. 20, 533-548 (1973). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 20 Documents MSC: 90C30 Nonlinear programming 90C25 Convex programming PDF BibTeX XML Cite \textit{H. A. Taha}, Nav. Res. Logist. Q. 20, 533--548 (1973; Zbl 0286.90052) Full Text: DOI References: [1] Balas, Operations Research 19 pp 19– (1971) [2] ”Solution of a Fixed Charge Linear Programming Problem,” Proceedings of Princeton Symposium on Mathematical Programming (Princeton University Press, Princeton, New Jersey, 1970), pp. 367–375. [3] Cabot, Operations Research 18 pp 82– (1970) [4] Gilmore, SIAM Journal 10 pp 305– (1962) [5] Glover, Operations Research 21 pp 123– (1973) [6] Lawler, Management Science 9 pp 586– (1963) [7] Murty, Operations Research 16 pp 268– (1968) [8] Raghavachari, Operations Research 17 pp 680– (1968) [9] Steinberg, Nav. Res. Log. Quart. 17 pp 217– (1970) [10] ”On the Solution of Zero-One Linear Programs by Ranking the Extreme Points,” Technical Rept. No. 71–2, University of Arkansas (Feb. 1971) revised May 1972. [11] Thompson, Management Science 12 pp 588– (1966) [12] Tuy, Soviet Math 5 pp 1437– (1964) [13] ”New Cuts for a Special Class of 0-1 Integer Programs,” Research Report, Rice University, Texas (Nov. 1968). This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.