The knapsack problem: A survey
- 1 March 1975
- journal article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 22 (1), 127-144
- https://doi.org/10.1002/nav.3800220110
Abstract
No abstract availableKeywords
This publication has 48 references indexed in Scilit:
- Capital Budgeting and Mixed Zero-One Integer ProgrammingA I I E Transactions, 1970
- Integer Programming over a Finite Additive GroupSIAM Journal on Control, 1969
- An algorithm for the computation of knapsack functionsJournal of Mathematical Analysis and Applications, 1969
- A Chance-Constrained Approach to Capital Budgeting with Portfolio Type Payback and Liquidity Constraints and Horizon Posture ControlsJournal of Financial and Quantitative Analysis, 1967
- A Model of Capital Budgeting Under RiskThe Journal of Business, 1966
- Investment and Discount Rates Under Capital Rationing--A Programming ApproachThe Economic Journal, 1965
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962
- An Automatic Method of Solving Discrete Programming ProblemsEconometrica, 1960
- Notes on the theory of dynamic programming IV ‐ Maximization over discrete setsNaval Research Logistics Quarterly, 1956
- Three Problems in Rationing CapitalThe Journal of Business, 1955