A fast interactive solution method for large capital expenditure selection problems
From MaRDI portal
Publication:1610122
DOI10.1016/S0377-2217(98)00171-4zbMath1007.91019OpenAlexW2071656741MaRDI QIDQ1610122
Publication date: 18 August 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00171-4
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Selection among ranked projects under segmentation, policy and logical constraints ⋮ Information technology capital budgeting using a knapsack problem ⋮ Project prioritization under policy restrictions. A combination of MCDA with 0-1 programming ⋮ Relief period optimization under budget constraints
Cites Work
- Unnamed Item
- Total unimodularity applications in bi-objective discrete optimization
- Theory and algorithms for linear multiple objective programs with zero–one variables
- Linear multiple objective programs with zero–one variables
- Solution of the Lorie-Savage and Similar Integer Programming Problems by the Generalized Lagrange Multiplier Method
This page was built for publication: A fast interactive solution method for large capital expenditure selection problems
