Discrete dynamic programming and capital allocation
From MaRDI portal
Recommendations
Cited in
(63)- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- Abandonment value in capital budeting: A mathematical programming approach
- Theory and applications of generalized dynamic programming: An overview
- The discrete-time model of Bagchi's regional investment allocation problem
- The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions
- A decision model for interdependent information system project selection
- Optimal distribution of funds between investment projects
- A dynamic allocation rule for the funding of projects and its long-run properties
- The multidimensional 0-1 knapsack problem: an overview.
- A fast interactive solution method for large capital expenditure selection problems
- Integer optimization with penalized fractional values: the knapsack case
- Bi-dimensional knapsack problems with one soft constraint
- Dynamic capital allocation with irreversible investments
- A universally-truthful approximation scheme for multi-unit auctions
- Finding representations for an unconstrained bi-objective combinatorial optimization problem
- Greedy algorithms for a class of knapsack problems with binary weights
- Shift-and-merge technique for the DP solution of the time-constrained backpacker problem
- Using analytic network process and goal programming for interdependent information system project selection
- A model of anytime algorithm performance for bi-objective optimization
- Shortest paths with a cost constraint: a probabilistic analysis
- Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem
- On the rectangular knapsack problem
- Pareto optimal allocations and dynamic programming
- Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems
- A serial inventory system with supplier selection and order quantity allocation considering transportation costs
- An alternative efficient representation for the project portfolio selection problem
- Internet routing between autonomous systems: fast algorithms for path trading
- An experimental study of random knapsack problems
- Characterization of canonical systems with six types of coins for the change-making problem
- The smoothed number of Pareto-optimal solutions in non-integer bicriteria optimization
- Dynamic programming with Pareto sets
- Dynamic programming models and algorithms for the mutual fund cash balance problem
- Lower bounds for the average and smoothed number of Pareto-optima
- Multi-objective Problems in Terms of Relational Algebra
- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
- Modeling multiple plant sourcing decisions
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
- A Reach and Bound algorithm for acyclic dynamic-programming networks
- Capital Budgeting Under Uncertainty—An Integrated Approach Using Contingent Claims Analysis and Integer Programming
- The variable sequencing approach: A solution to the capital budget allocation model
- Generating the Discrete Efficient Frontier to the Capital Budgeting Problem
- Note—An Improved Discrete Dynamic Programming Algorithm for Allocating Resources Among Interdependent Projects
- An Analysis of a Dynamic Project Cost Problem
- A hybrid approach to discrete mathematical programming
- Optimal dynamic capital budgeting
- Dynamic programs with shared resources and signals: dynamic fluid policies and asymptotic optimality
- Smoothing the Gap Between NP and ER
- A minimal algorithm for the bounded knapsack problem
- scientific article; zbMATH DE number 7053320 (Why is no real title available?)
- scientific article; zbMATH DE number 4183129 (Why is no real title available?)
- Statistical mechanics analysis of generalized multi-dimensional knapsack problems
- Random knapsack in expected polynomial time
- The smoothed number of Pareto-optimal solutions in bicriteria integer optimization
- Optimization of multilevel investments using dynamic programming based on fuzzy cash flows
- The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability
- Branch-and-bound and dynamic programming approaches for the knapsack problem
- Solving large-scale capital budgeting problems with column generation and optimization-based sorting
- Parameterized algorithms for computing Pareto sets
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- An exact algorithm for the knapsack sharing problem with common items
- A multiobjective evolutionary approach for linearly constrained project selection under uncertainty
- Resource allocation when projects have ranges of increasing returns
- Solving efficiently the 0-1 multi-objective knapsack problem
This page was built for publication: Discrete dynamic programming and capital allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115910)
