| Bernhard R H. Mathematical programming models for captial budgeting---a survey generalization and critique [J]. Journals of Financia lquarterly Analysis, 1969, 4: 111-158.Bernhard R H. Mathematical programming models for captial budgeting---a survey generalization and critique [J]. Journals of Financia lquarterly Analysis, 1969, 4: 111-158.黄红选, 韩继业. 数学规划 [M]. 北京：清华大学出版社, 2006. Bretthauer K M, Shetty B. Quadratic resource allocation with generalized upper bounds [J]. Oper Res Lett, 1997, 20: 51-57. Bretthauer K M, Shetty B. The nonlinear resource allocation problem [J]. Operations Research, 1995, 43: 670-683. Bitran G R, Hax A C. Disaggregation and resource allocation using convex knapsack problems with bounded variables [J]. Management Science, 1981, 27: 431-441. 黄红选. 运筹学：数学规划 [M]. 北京：清华大学出版社, 2011. Bitran G R, Hax A C. Disaggregation and resource allocation using convex knapsack problems with bounded variables [J]. Manag Sci, 1981, 27: 431-441. Caprara A, Pisinger D, Toth P. Exact solution of the quadratic knapsack problem [J]. INPORMS Journal on Computing, 1999, 11: 125-137. Chu P C, Beasley J E. A genetic algorithm for the multidimensional knapsack problem [J]. Journal of Heuristics, 1998, 4: 63-86. Bretthauer K M, Shetty B, Syam S. A branch and bound algorithm for integer quadratic knapsack problems [J]. ORSA Journal on Computing, 1995, 7(1): 109-118. Kiwiel K C. Variable fixing algorithms for the continuous quadratic knapsack problem [J]. Journal of Optimization Theory and Applications, 2008, 136: 445-458. Mathur K, Salkin H M, Morito S. A branch and search algorithm for a class of nonlinear knapsack problems [J]. Operations Research Letters, 1983, 2: 155-60. Jorge J M, Stephen A V. On the solution of concave knapsack problems [J]. Mathmatical Programming, 1991, 49: 397-411. Robinson A G, Jiang N, Lerme C S. On the continuous quadratic knapsack problem [J]. Mathematical Programming, 1992, 55: 99-108. Guder F, Morris J G. Optimal objective function approximation for separable convex quadratic programming [J]. Mathematical Programming, 1994, 67: 133-142. 华中生, 张斌. 求解可分离连续凸二次背包问题的直接算法 [J]. 系统工程与电子技术, 2005, 27(2): 331-334. Rosen J B, Pardalos P M. Global minimization of large-scale constrained concave quadratic problems by separable programming [J]. Math Program, 1986, 34: 163-174.Rosen J B, Pardalos P M. Global minimization of large-scale constrained concave quadratic problems by separable programming [J]. Math Program, 1986, 34: 163-174. 任燕, 陈伟. 可分离的二次背包问题的一种直接算法 [J]. 上海大学学报, 2010, 4: 387-393. Li J L, Wang P, Ma L. A new algorithm for the general quadratic programming problems with box constraints [J]. Original Paper, 2010, 55: 79-85. Zhang X J, Sun X L, Li D. Separable relaxation for nonconvex quadratic integer programming:integer diagonalization approach [J]. Optim Theory Appl, 2010, 146: 463-489. Pardalos P M, Kovoor N. An algorithm for a singly constrained class of Quadratic programs subject to upper and lower bounds [J]. Mathematical Programming, 1990, 46: 321-328. Horst R, Thoai N V. An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks [J]. OR Spektrum, 1998, 20: 47-53. Stefan M. Stefanov. Convex seperable minimization subject to bounded variables [J]. Computational Optimization and Applications, 2001, 18: 27-48. Bretthauer K M, Shetty B. The nonlinear knapsack problem---algorithms and applications [J]. European Journal of Operations Research, 2002, 138: 459-472. Bretthauer K M, Shetty B. A pegging algorithm for the nonlinear resource allocation problem [J]. Computers Operations Research, 2002, 29: 505-527. |
