Quadratic knapsack problems
暂无分享,去创建一个
[1] E. Beale. An algorithm for solving the transportation problem when the shipping cost over each route is convex , 1959 .
[2] M. Balinski. Fixed‐cost transportation problems , 1961 .
[3] D. J. Laughhunn. Quadratic Binary Programming with Application to Capital-Budgeting Problems , 1970, Oper. Res..
[4] M. Balinski. Notes—On a Selection Problem , 1970 .
[5] J. Rhys. A Selection Problem of Shared Fixed Costs and Network Flows , 1970 .
[6] A. Victor Cabot,et al. Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points , 1970, Oper. Res..
[7] M. Desu. A Selection Problem , 1970 .
[8] Hamdy A. Taha. Concave minimization over a convex polyhedron , 1973 .
[9] Petersen CliffordC.. A Capital Budgeting Heuristic Algorithm Using Exchange Operations , 1974 .
[10] Peter L. Hammer,et al. Constraint Pairing In Integer Programming , 1975 .
[11] Mathematical methods of site selection for Electronic Message Systems (EMS) , 1975 .
[12] Harvey M. Salkin,et al. The knapsack problem: A survey , 1975 .