A hypercube algorithm for the 0/1 knapsack problem
Journal of Parallel and Distributed Computing
Communications of the ACM
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Coordinating product, process, and supply chain decisions: A constraint satisfaction approach
Engineering Applications of Artificial Intelligence
Note on incremental benefit/cost ratios in analytic hierarchy process
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.98 |
Benefit-cost analysis has traditionally required monetary measures of benefits and costs of candidate projects. This paper demonstrates that priorities of both tangible and intangible attributes can be used in a benefit-cost setting to address the long standing problem of allocating multiple resources to projects. Although it is widely accepted that proper structuring of analytic hierarchies can achieve aggregation of a number of small projects so that their cumulative benefits are comparable to that of a large project, it frequently happens in budgetary allocation that large sums of money are allocated to a project whose intangible benefits are stretched out over much larger time horizons than other urgent projects with short term benefits. Here, the two hierarchies used to set priorities on benefits and on costs need to consider different time horizons. The Analytic Hierarchy Process and knapsack optimization are used to formulate problems in which a number of projects might be implemented by judicious distribution of resources available. For many applications, one seeks to maximize a function of net benefit, subject only to the constraints imposed by resource limitations. In others, benefit to cost ratios of projects obtained from two separate hierarchies are used. Our knapsack or recursive knapsack formulation is a complex combinatorial problem that would require approximate heuristic methods for its solution. Several realistic variants of the knapsack problem are illustrated. The computational tractability of practical knapsack problems is discussed. This paper contributes to our ability to make strategic allocation decision-where the diversity of benefits and costs demands inclusive measurement, and where optimal resource allocation is demanded by the importance of the decisions.