Dynamic programming approaches to the multiple criteria knapsack problem

Naval Research Logistics

Volumn 47, Issue 1, 2000, Pages 57-76

  Klamroth, Kathrin ^a   Wiecek, Margaret M ^b  

^a CLEMSON UNIVERSITY   (United States)

^b Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING;

MULTIPLE CRITERIA KNAPSACK PROBLEM;

LOGISTICS;

EID: 0033891465     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(200002)47:1<57::AID-NAV4>3.0.CO;2-4     Document Type: Article

References (32)

1. R. Bellman, Dynamic programming, Princeton University Press, Princeton, NJ, 1957.
2. K. Bhaskar, A multiple objective approach to capital budgeting, Account Bus Res 9 (1979), 25-46.
3. G.R. Bitran, Linear multiple objective programs with zero-one variables, Math Program 13 (1977), 121-139.
4. G.R. Bitran, Theory and algorithms for linear multiple objective programs with zero-one variables, Math Program 17 (1979), 362-390.
5. T.A. Brown and R.E. Strauch, Dynamic programming in multiplicative laticces, J Math Anal Appl 12 (1965), 364-370.
6. L.G. Chalmet, L. Lemonidis, and D.J. Elzinga, An algorithm for the bi-criterion integer programming problem, Eur J Oper Res 25 (1986), 292-300.
7. H.W. Corley and I.D. Moon, Shortest paths in networks with vector weights, J Optim Theor Appl 46 (1985), 79-86.
8. K. Dudziński and S. Walukiewicz, On the multiperiod binary knapsack problem, Methods Oper Res 50 (1985), 223-232.
9. M. Eben-Chaime, Parametric solution for linear bicriteria knapsack models, Manage Sci 42 (1996), 1565-1575.
10. R.S. Garfinkel and G.L. Nemhauser, Integer programming, Wiley, New York, 1972.
11. R. Hartley, "Vector optimal routing by dynamic programming," Mathematics of multiobjective optimization, P. Serafini (Editor), Springer-Verlag, Vienna, 1985, pp. 215-224.
12. M. Henig, Vector-valued dynamic programming, SIAM J Control Optim 21 (1983), 490-499.
13. T. Ibaraki, "Enumerative approaches to combinatorial optimization, part ii," Annals of operations research, P.L. Hammer (Editor), Baltzer, Basel, 1987, Vol. 11, pp. 343-602.
14. K. Klamroth and M.M. Wiecek, A time-dependent multiple criteria knapsack problem, Technical Report 664, Department of Mathematical Sciences, Clemson University, Clemson, SC, 1998.
15. D. Klein and E. Hannan, An algorithm for the multiple objective integer linear programming problem, Eur J Oper Res 93 (1982), 378-385.
16. A.J. Kleywegt and J.D. Papastavrou, The dynamic and stochastic knapsack problem, Oper Res 46 (1998), 17-35.
17. R. Klötzler, Multiobjective dynamic programming, Math Operationsforsch Stat Ser Optim 9 (1978), 423-426.
18. M.M. Kostreva, W. Ogryczak, and D.W. Tonkyn, Relocation problems arising in conservation biology, Comput Math Appl 37 (1999), 135-150.
19. W. Kwak, Y. Shi, H. Lee, and C.F. Lee, Capital budgeting with multiple criteria and multiple decision makers. Rev Quantitative Finance Account 7 (1996), 97-112.
20. S. Martello, D. Pisinger, and P. Toth, New trends in exact algorithms for the O 1 knapsack problem, Proc EURO/INFORMS-97, Barcelona, J. Barceló (Editor), 1997, pp. 151-160.
21. S. Martello and P. Toth, Knapsack problems: Algorithms and computer implementations, Wiley, New York, 1990.
22. M.J. Rosenblatt and Z. Sinuany-Stern, Generating the discrete efficient frontier to the capital budgeting problem, Oper Res 37 (1989), 384-394.
23. H.M. Salkin, Integer programming, Addison-Wesley, Reading, MA, 1975.
24. J.-Y. Teng and G.-H. Tzeng, A multiobjective programming approach for selecting non-independent transportation investment alternatives. Transport Res B 30 (1996), 291-307.
25. T. Trzaskalik, Multiple criteria discrete dynamic programming, Math Today, XII-A (1994), 173-199.
26. E.L. Ulungu and J. Teghem, Application of the two phases method to solve the bi-objective knapsack problem, Technical Report, Department of Mathematics Operational Research, Faculté Polytechnique de Mons, Mons, Belgium, 1994.
27. E.L. Ulungu and J. Teghem, "Solving multi-objective knapsack problems by a branch-and-bound procedure," In Multicriteria analysis, J.N. Climaco (Editor), Springer-Verlag, New York, 1997, pp. 269-278.
28. R. Vetschera, Time preferences in capital budgeting - an application of interactive multiobjective optimization, Methods Oper Res 50 (1985), 649-660.
29. B. Villarreal and M.H. Karwan, Multicriteria integer programming: A (hybrid) dynamic programming recursive approach, Math Program 21 (1981), 204-223.
30. B. Villarreal and M.H. Karwan, Multicriteria dynamic programming with an application to the integer case, J Math Anal Appl 38 (1982), 43-69.
31. M. Visée, J. Teghem, M. Pirlot, and E.L. Ulungu, Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem, Technical Report, Department of Mathematics Operational Research, Faculté Polytechnique de Mons, Mons, Belgium, 1996.
32. P.L. Yu and L. Seiford, "Multistage decision problems with multiple criteria," Multiple criteria analysis, P. Nijkamp and J. Spronk (Editors), Gower, Aldershot, UK, 1981, pp. 235-244.