×

zbMATH — the first resource for mathematics

A polynomially bounded algorithm for a singly constrained quadratic program. (English) Zbl 0452.90054

MSC:
90C20 Quadratic programming
90C25 Convex programming
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] A. Ali, R. Helgason, J. Kennington and H. Lall, ”Solving multicommodity network flow problems”,Operations Research, to appear. · Zbl 0445.90086
[2] G.R. Bitran and A.C. Hax, ”On the solution of convex knapsack problems with bounded variables”, in: A. PrĂ©kopa, ed.,Survey of mathematical programming, Vol. 1 (North-Holland, Amsterdam, 1979) pp. 357–367. · Zbl 0428.90062
[3] A. Charnes and W.W. Cooper, ”The theory of search: optimum distribution of search effort”,Management Science 5 (1958) 44–50. · Zbl 0995.90543
[4] M. Held, P. Wolfe and H. Crowder, ”Validation of subgradient optimization”,Mathematical Programming 6 (1974) 62–88. · Zbl 0284.90057
[5] J. Kennington and M. Shalaby, ”An effective subgradient procedure for minimal cost multicommodity flow problems”,Management Science 23 (1977) 994–1004. · Zbl 0366.90118
[6] E.L. Lawler,Combinatorial optimization: networks and matroids (Holt, Rinehart, and Winston, New York, 1976). · Zbl 0413.90040
[7] H. Luss and S.K. Gupta, ”Allocation of effort resources among competing activities”,Operations Research 23 (1975) 360–365. · Zbl 0298.90015
[8] C.J. McCallum Jr., ”An algorithm for certain quadratic integer programs”, Bell Laboratories Technical Report, Holmdel, NJ (undated).
[9] L. Sanathanan, ”On an allocation problem with multistage constraints”,Operations Research 19 (1971) 1647–1663. · Zbl 0227.90041
[10] K.S. Srikantan, ”A problem in optimum allocation”,Operations Research 11 (1963) 265–273. · Zbl 0114.12002
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.