Dynamic programming approaches to the multiple criteria knapsack problem
- 13 January 2000
- journal article
- research article
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 47 (1) , 57-76
- https://doi.org/10.1002/(sici)1520-6750(200002)47:1<57::aid-nav4>3.0.co;2-4
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Parametric Solution for Linear Bicriteria Knapsack ModelsManagement Science, 1996
- PrefaceAnnals of Operations Research, 1987
- An algorithm for the bi-criterion integer programming problemEuropean Journal of Operational Research, 1986
- Shortest paths in networks with vector weightsJournal of Optimization Theory and Applications, 1985
- Vector-Valued Dynamic ProgrammingSIAM Journal on Control and Optimization, 1983
- An algorithm for the multiple objective integer linear programming problemEuropean Journal of Operational Research, 1982
- Theory and algorithms for linear multiple objective programs with zero–one variablesMathematical Programming, 1979
- A Multiple Objective Approach to Capital BudgetingAccounting and Business Research, 1979
- Linear multiple objective programs with zero–one variablesMathematical Programming, 1977
- Dynamic programming in multiplicative latticesJournal of Mathematical Analysis and Applications, 1965