Note—An Improved Discrete Dynamic Programming Algorithm for Allocating Resources Among Interdependent Projects

DOI10.1287/mnsc.37.9.1195zbMath0745.90048MaRDI QIDQ3985151

Robert L. Carraway, Robert L. Schmidt

Publication date: 27 June 1992

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.37.9.1195

zbMATH Keywords

discrete dynamic programming; capital allocation

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90C10: Integer programming

90B35: Deterministic scheduling theory in operations research

90C39: Dynamic programming

90C09: Boolean programming

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

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Truck scheduling at zero-inventory cross docking terminals, Constructing strategies in strategic planning: a decision support evaluation model, Sequencing mixed-model assembly lines to minimize part inventory cost, Heuristics and exact algorithms for solving the Monden problem, A new global approach for \(0\)-\(1\) polynomial programs, Dispersion with connectivity in wireless mesh networks, Genetic algorithm-based multi-criteria project portfolio selection, An application of dynamic programming to assign pressing tanks at wineries, Scheduling inbound and outbound trucks at cross docking terminals, Scheduling just-in-time part supply for mixed-model assembly lines, An alternative efficient representation for the project portfolio selection problem