Discrete Dynamic Programming and Capital Allocation

DOI10.1287/mnsc.15.9.494zbMath1231.90339MaRDI 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

Mathematics Subject Classification ID

90C10: Integer programming

90C29: Multi-objective and goal programming

91B32: Resource and cost allocation (including fair division, apportionment, etc.)

Related Items

Random knapsack in expected polynomial time, 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, Solving efficiently the 0-1 multi-objective knapsack problem, Implementing an efficient fptas for the 0-1 multi-objective knapsack problem, Theory and applications of generalized dynamic programming: An overview, The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions, A decision model for interdependent information system project selection, The multidimensional 0-1 knapsack problem: an overview., Using analytic network process and goal programming for interdependent information system project selection, An experimental study of random knapsack problems, 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, A Reach and Bound algorithm for acyclic dynamic-programming networks, A hybrid approach to discrete mathematical programming