A new effective dynamic program for an investment optimization problem
From MaRDI portal
Recommendations
- A graphical approach to solve an investment optimization problem
- A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems
- Dynamic programming revisited: Improving knapsack algorithms
- scientific article; zbMATH DE number 536590
- scientific article; zbMATH DE number 3852791
Cites work
- A fuzzy DEA and knapsack formulation integrated model for project selection
- A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm
- A graphical approach to solve an investment optimization problem
- A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems
- Algorithms for the bounded set-up knapsack problem
- Algorithms with guarantee value for knapsack problems
- An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs
- An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
- Approximation algorithms for knapsack problems with cardinality constraints
- Balancing and optimizing a portfolio of R&D projects
- Dynamic order acceptance and capacity planning on a single bottleneck resource
- scientific article; zbMATH DE number 3767009 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Hybrid rounding techniques for knapsack problems
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- Improved dynamic programming in connection with an FPTAS for the knapsack problem
- Improved dynamic programs for some batching problems involving the maximum lateness criterion
- Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization
- Nonconvex piecewise linear knapsack problems
- Online dynamic programming speedups
- Piecewise convex maximization approach to multiknapsack
- Selection among ranked projects under segmentation, policy and logical constraints
- The Hijazi inequality on manifolds with boundary
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
Cited in
(6)- An efficient algorithm of dead-end controls for solving combinatorial optimization problems
- A graphical approach to solve an investment optimization problem
- Graphical method to solve combinatorial optimization problems
- Оптимизация динамических систем инвестирования промышленных предприятий
- Optimal decision-making of mutual fund temporary borrowing problem via approximate dynamic programming
- Optimal investment models with vintage capital: dynamic programming approach
This page was built for publication: A new effective dynamic program for an investment optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q505320)
