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

DOI10.1287/mnsc.37.9.1195zbMath0745.90048OpenAlexW1989771942MaRDI 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 programmingcapital allocation

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Boolean programming (90C09) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (11)

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

This page was built for publication: Note—An Improved Discrete Dynamic Programming Algorithm for Allocating Resources Among Interdependent Projects