Methods for selecting the optimal portfolio of projects

Proceedings of 2008 IEEE International Conference on Service Operations and Logistics, and Informatics, IEEE/SOLI 2008

Volumn 2, Issue , 2008, Pages 2617-2622

  Ding, Wei ^a   Cao, Rongzeng ^a  

^a IBM CHINA RESEARCH LAB   (China)

Author keywords

Dynamic programming; Knapsack problem; Project portfolio selection

Indexed keywords

COMPUTER SOFTWARE SELECTION AND EVALUATION; DYNAMIC PROGRAMMING; FUNCTIONS; INTEGER PROGRAMMING; MATHEMATICAL PROGRAMMING; RISK ANALYSIS; SYSTEMS ENGINEERING;

DYNAMIC PROGRAMMING ALGORITHMS; KNAPSACK PROBLEM; OPTIMAL PORTFOLIOS; OPTIMAL PROJECTS; PORTFOLIO ANALYSES; PROJECT PORTFOLIO SELECTION; SIMULATION OPTIMIZATIONS; TOP DOWNS;

MATHEMATICAL MODELS;

EID: 58049169898     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SOLI.2008.4682979     Document Type: Conference Paper

References (16)

1. H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems, Springer, Berlin, 2004.
2. M.R. Garey and D.S.Johnson, Computers and Intractability: A guide to the theory of NP-completeness, WH Freeman, San Francisco, 1979.
3. E. Horowitz and S. Sahni, "Computing partitions with applications to the Knapsack Problem", Journal of the ACM, 21, 1974, pp.277-292.
4. R.M. Nauss, "An efficient algorithm for the 0-1 knapsack problem", Operations Research, vol. 45, 1976, pp. 27-31.
5. S. Martello, P. Toth, "An upper bound for the zero-one knapsack problem and a branch and bound algorithm", European Journal of Operational Research, vol. 1, 1977, pp. 169-175.
6. S. Martello, P. Toth , Knapsack Problems: Algorithms and Computer Implementations, Wiley, Chichester, UK, 1990.
7. R.E. Bellman, Dynamic programming, Princeton University Press, Princeton, NJ, 1957.
8. D.S. Johnson and K.A. Niemi, "On knapsacks, partitions, and a new dynamic programming technique for trees", Mathematics of Operations Research, vol. 8, 1983, pp. 1-14.
9. D.X. Shaw and G. Cho, "The critical item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem", Networks vol. 28, 1998, pp. 205-216.
10. G. Cho and D.X. Shaw, "A depth-first dynamic programming algorithm for the tree knapsack problem", INFORMS Journal on Computing, vol. 9, 1997, pp. 431-438.
11. N. Samphaiboon and T. Yamada, "Heuristic and Exact Algorithms for the Precedence Constrained Knapsack Problem", Journal of Optimization Theory and Applications, vol. 105, 2000, pp. 659-676.
12. S. Martello D. Pisinger, P. Toth, "A exact algorithm for the two-constraint 0-1 knapsack problem", Operations Research, vol. 51, 2003, pp. 826-835.
13. S. Martello, P. Toth, "A branch and bound algorithm for the zero-one multiple knapsack problem", Discrete Applied Mathematics, vol. 3, 1981, pp. 275-288.
14. D. Pisinger, "The multiple loading problem", in Proceedings NOAS'95, University of Reykjavik, Iceland, 1995.
15. S. Martello D. Pisinger, P. Toth, "New trends in exact algorithms for the 0-1 knapsack problem", European Journal of Operational Research, vol. 123, 2000, pp. 325-332.
16. J. April, F. Glover, J. P. Kelly, "OPTFOLIO - A simulation optimization system for project portfolio planning", Proceedings of the 2003 Winter Simulation Conference, 2003