A new effective dynamic program for an investment optimization problem

DOI10.1134/S0005117916090101zbMath1354.90162OpenAlexW2516388696WikidataQ57633763 ScholiaQ57633763MaRDI QIDQ505320

Evgeny R. Gafarov, Frank Werner, Alexandre Dolgui, Alexander A. Lazarev

Publication date: 20 January 2017

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117916090101

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (2)

Graphical method to solve combinatorial optimization problems ⋮ An efficient algorithm of dead-end controls for solving combinatorial optimization problems

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm
• A graphical approach to solve an investment optimization problem
• Online dynamic programming speedups
• Nonconvex piecewise linear knapsack problems
• A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems
• Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
• Approximation algorithms for knapsack problems with cardinality constraints
• Improved dynamic programs for some batching problems involving the maximum lateness criterion
• Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
• A fuzzy DEA and knapsack formulation integrated model for project selection
• Improved dynamic programming in connection with an FPTAS for the knapsack problem
• Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization
• Selection among ranked projects under segmentation, policy and logical constraints
• Algorithms for the bounded set-up knapsack problem
• Hybrid rounding techniques for knapsack problems
• An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
• The Hijazi inequality on manifolds with boundary
• Balancing and optimizing a portfolio of R&D projects
• An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs
• Algorithms with guarantee value for knapsack problems
• Dynamic order acceptance and capacity planning on a single bottleneck resource
• Piecewise convex maximization approach to multiknapsack

This page was built for publication: A new effective dynamic program for an investment optimization problem