Knapsack allocation of multiple resources in benefit-cost analysis by way of the analytic hierarchy process

DOI10.1016/0895-7177(93)90175-XMaRDI QIDQ2365534zbMATH OpenOpenAlexFDO

Authors James P. Bennett, Thomas L. Saaty

Publication date 29 June 1993

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0895-7177(93)90175-x

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10) Decision theory (91B06) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites work

• A scaling method for priorities in hierarchical structures
• Exact methods for the knapsack problem and its generalizations
• scientific article; zbMATH DE number 2086188 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3501238 (Why is no real title available?)
• Languages and compilers for parallel computing. 7th international workshop, Ithaca, NY, USA, August 8-10, 1994. Proceedings

Cited in

(2)

• Note on incremental benefit/cost ratios in analytic hierarchy process
• Magnitude adjustment for AHP benefit/cost ratios

This page was built for publication: Knapsack allocation of multiple resources in benefit-cost analysis by way of the analytic hierarchy process

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365534)