Information technology capital budgeting using a knapsack problem

DOI10.1111/J.1475-3995.2006.00551.XMaRDI QIDQ5489128zbMATH OpenOpenAlexFDO

Authors Parag C. Pendharkar, James A. Rodger

Publication date 25 September 2006

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/j.1475-3995.2006.00551.x

zbMATH Keywords

artificial intelligence/heuristicscapital budgetingIT investmentsknapsack optimizationobject-oriented programmingsimulated annealingUML modeling

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Solving knapsack problems with \(S\)-curve return functions
• Simulated annealing for the 0/1 multidimensional knapsack problem
• scientific article; zbMATH DE number 4106565
• An extension of a greedy heuristic for the knapsack problem
• scientific article; zbMATH DE number 3852791

Cites work

• A fast interactive solution method for large capital expenditure selection problems
• A simulated annealing code for general integer linear programs
• Capital budgeting, investment project valuation and financing mix: methodological proposals.
• scientific article; zbMATH DE number 42729 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• Relief period optimization under budget constraints

This page was built for publication: Information technology capital budgeting using a knapsack problem

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