Generating the Discrete Efficient Frontier to the Capital Budgeting Problem
From MaRDI portal
Publication:3823367
DOI10.1287/OPRE.37.3.384zbMATH Open0669.90009OpenAlexW2024344169MaRDI QIDQ3823367FDOQ3823367
Authors: Meir J. Rosenblatt, Zilla Sinuany-Stern 
Publication date: 1989
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.37.3.384
Recommendations
- Capital budgeting problems: a parameterized point of view
- Discrete dynamic programming and capital allocation
- Dependent-chance integer programming applied to capital budgeting
- scientific article; zbMATH DE number 428256
- scientific article; zbMATH DE number 4207168
- An effective matheuristic for the capacitated total quantity discount problem
- Improved rounding procedures for the discrete version of the capacitated EOQ problem
- A fast interactive solution method for large capital expenditure selection problems
- Optimal dynamic capital budgeting
heuristic algorithmbranch-and-boundcapital budgetingtwo objective functionsDiscrete Efficient Frontier
Cited In (18)
- Dynamic evolution of economically preferred facilities
- A single facility location problem with a weighted maximin-minimax rectilinear distance
- Inverse multi-objective combinatorial optimization
- Investment decisions and sensitivity analysis: NPV-consistency of rates of return
- Title not available (Why is that?)
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
- A quantum-inspired artificial immune system for the multiobjective 0-1 knapsack problem
- A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- Computing partitions with applications to capital budgeting problems
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- Solving efficiently the 0-1 multi-objective knapsack problem
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- Quadratic model for allocating operational budget in public and nonprofit organizations
- A survey of recent developments in multiobjective optimization
- The variable sequencing approach: A solution to the capital budget allocation model
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
This page was built for publication: Generating the Discrete Efficient Frontier to the Capital Budgeting Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3823367)
