Discrete Dynamic Programming and Capital Allocation
From MaRDI portal
Publication:3115910
DOI10.1287/MNSC.15.9.494zbMath1231.90339OpenAlexW2007458506MaRDI QIDQ3115910
Nemhauser, George I., Zev Ullmann
Publication date: 12 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.15.9.494
Integer programming (90C10) Multi-objective and goal programming (90C29) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (43)
An experimental study of random knapsack problems ⋮ Integer optimization with penalized fractional values: the knapsack case ⋮ Bi-dimensional knapsack problems with one soft constraint ⋮ Smoothing the Gap Between NP and ER ⋮ A multiobjective evolutionary approach for linearly constrained project selection under uncertainty ⋮ Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem ⋮ On the rectangular knapsack problem ⋮ Theory and applications of generalized dynamic programming: An overview ⋮ Multi-objective Problems in Terms of Relational Algebra ⋮ The smoothed number of Pareto-optimal solutions in bicriteria integer optimization ⋮ A minimal algorithm for the Bounded Knapsack Problem ⋮ Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach ⋮ Characterization of canonical systems with six types of coins for the change-making problem ⋮ Modeling multiple plant sourcing decisions ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization ⋮ Using analytic network process and goal programming for interdependent information system project selection ⋮ A universally-truthful approximation scheme for multi-unit auctions ⋮ Solving efficiently the 0-1 multi-objective knapsack problem ⋮ Finding representations for an unconstrained bi-objective combinatorial optimization problem ⋮ Improved smoothed analysis of multiobjective optimization ⋮ 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 ⋮ The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions ⋮ A model of anytime algorithm performance for bi-objective optimization ⋮ Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems ⋮ Random knapsack in expected polynomial time ⋮ A serial inventory system with supplier selection and order quantity allocation considering transportation costs ⋮ A hybrid approach to discrete mathematical programming ⋮ The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability ⋮ Shortest paths with a cost constraint: a probabilistic analysis ⋮ Branch-and-bound and dynamic programming approaches for the knapsack problem ⋮ A Reach and Bound algorithm for acyclic dynamic-programming networks ⋮ A decision model for interdependent information system project selection ⋮ Unnamed Item ⋮ Implementing an efficient fptas for the 0-1 multi-objective knapsack problem ⋮ Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem ⋮ An alternative efficient representation for the project portfolio selection problem ⋮ A heuristic algorithm for the multidimensional zero-one knapsack problem ⋮ Internet routing between autonomous systems: fast algorithms for path trading ⋮ Unnamed Item ⋮ Statistical mechanics analysis of generalized multi-dimensional knapsack problems ⋮ An exact algorithm for the knapsack sharing problem with common items
This page was built for publication: Discrete Dynamic Programming and Capital Allocation
