A fast interactive solution method for large capital expenditure selection problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3891122
- An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems
- The variable sequencing approach: A solution to the capital budget allocation model
- Discrete dynamic programming and capital allocation
- An improved interactive hybrid method for the linear multi-objective knapsack problem
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- Linear multiple objective programs with zero–one variables
- Solution of the Lorie-Savage and Similar Integer Programming Problems by the Generalized Lagrange Multiplier Method
- Theory and algorithms for linear multiple objective programs with zero–one variables
- Total unimodularity applications in bi-objective discrete optimization
Cited in
(7)- Relief period optimization under budget constraints
- Selection among ranked projects under segmentation, policy and logical constraints
- Project prioritization under policy restrictions. A combination of MCDA with 0-1 programming
- The variable sequencing approach: A solution to the capital budget allocation model
- Generating the Discrete Efficient Frontier to the Capital Budgeting Problem
- scientific article; zbMATH DE number 912667 (Why is no real title available?)
- Information technology capital budgeting using a knapsack problem
This page was built for publication: A fast interactive solution method for large capital expenditure selection problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1610122)
