Interactive knapsacks

Fundamenta Informaticae

Volumn 44, Issue 1-2, 2000, Pages 1-23

  Aho, Isto ^a,b  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

^b Dept of Comp and Info Sciences ^*  (Finland)

Author keywords

Knapsack models; Knapsack problem; Longest path; NP complete

Indexed keywords

EID: 0012519118     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. Aho I.: "On the properties of dynamic programming used in direct load control scheduling", Submitted to IEEE Transactions on Power Systems.
2. Aho I.: "Interactive knapsacks", Technical Report A-1999-5, University of Tampere, Dept. of Computer Science, 1999.
3. Aho I., Klapuri H., Saarinen J. and Mäkinen E.: "Optimal load clipping with time of use rates", International Journal of Electrical Power & Energy Systems, 20(4), 1998, 269-280.
4. Ausiello, G., Crescenzi, P. and Protasi M.: "Approximate solution of NP optimization problems", Theoretical Computer Science, 150(1), 1995, 1-55.
5. Carraresi P., Farinaccio F. and Malucelli F.: "Testing optimality for quadratic 0-1 problems", Technical Report TR-95-11, Universit̀ Di Pisa, Departimento Di Informatica, 1996.
6. Caves, D. W. and Herriges, J. A.: ̀Optimal dispatch of interruptible and curtailable service options̀, Operations Research, 40(1), 1992, 104-112.
7. Dyer, M. E. and Frieze, A. M.: ̀Probabilistic analysis of the multidimensional knapsack problem̀, Mathematics of Operations Research, 14(1), 1989, 162-176.
8. Garey, M. R. and Johnson D. S.: Computers and Intractability, A Guide to the Theory of NP-completeness, New York: W. H. Freeman, 1979.
9. Graham, R. L., Knuth, D. E. and Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science, New York: Addison-Wesley, 1989.
10. Hall, L. A.: "Approximation algorithms for scheduling". D. S. Hochbaum (ed.), Approximation Algorithms for NP-hard Problems Boston: PWS Publishing Company, 1995, 1-45.
11. Henig, M. I.: "Risk criteria in a stochastic knapsack problem", Operations Research, 38(5), 1990, :820-825.
12. Kleywegt, A. J. and Papastavrou, J. D.: "The dynamic and stochastic knapsack problem", Operations Research, 46(1), 1998, 17-35.
13. Krentel, M. W.: "The complexity of optimization problems", Technical Report TR87-834, Cornell University, Computer Science Department, 1987.
14. Krentel, M. W.: "The complexity of optimization problems", Journal of Computer and System Sciences, 36(3), 1988, 490-509.
15. Krentel, M. W.: "On finding and verifying locally optimal solutions", SIAM Journal on Computing, 19(4), 1990, 742-749.
16. Laguna, M.: "Robust optimization for multiperiod capacity expansion planning in telecommunications", working paper.
17. Lawler, E. L.: Combinatorial Optimization: Networks and Matroids, New York: Holt, Rinehart and Winston, 1976.
18. Martello, S. and Toth, P.: Knapsack Problems: Algorithms and Computer Implementations, Chichester: John Wiley & Sons, 1990.
19. Möhring, R. H. and Radermacher, F. J.: "Introduction to stochastic scheduling problems", Technical Report MIP - 8402, Universität Passau, 1984.
20. Pinedo, M.: Scheduling: Theory, Algorithms, and Systems, New Jersey: Prentice Hall, 1995.
21. Reingold, E. M., Nievergelt, J. and Deo N.: Combinatorial Algorithms: Theory and Practice, New Yersey, Prentice Hall, 1977.
22. Saniee, I.: "An efficient algorithm for the multiperiod capacity expansion of one location in the telecommunications", Operations Research, 43(1), 1995, 187-190.
23. Vollmer, H. and Wagner, K. W.: "Complexity classes of optimization functions", Information and Computation, 120(2), 1995, 198-219.