The project coordinator's problem

Balinski, 1970, On a selection problem, Mgmt Sci., 17, 230, 10.1287/mnsc.17.3.230 Doersch, 1977, Scheduling a project to maximize its present value: a zero-one programming approach, Mgmt Sci., 23, 882, 10.1287/mnsc.23.8.882 Gear, 1971, Analysis of some portfolio selection models for R & D, IEEE Trans. on Engng Mgmt, EM-18, 66, 10.1109/TEM.1971.6447130 Geoffrion, 1972, Lagrangian relaxation for integer programming, Math. Prog. Study, 2, 82, 10.1007/BFb0120690 Glover, 1974, A computation study on start procedures, Mgmt Sci., 20, 793, 10.1287/mnsc.20.5.783 Heller, 1958, An extension of a theorem of Dantzig, 247 Lockett, 1972, Programme selection in research and development, Mgmt Sci, 18, B575, 10.1287/mnsc.18.10.B575 Murchland, 1968, Rhys's combinatorial station selection problem Nauss, 1976, An efficient algorithm for the 0–1 knapsack problem, Mgmt Sci., 23, 27, 10.1287/mnsc.23.1.27 Nauss, 1976 Penz, 1976, A multiple resource constrained scheduling approach to large residential land developments Picard, 1976, Maximal closure of a graph and applications to combinatorial problems, Mgmt Sci., 22, 1268, 10.1287/mnsc.22.11.1268 Pritsker, 1969, Multi-project scheduling with limited resources: a zero-one programming approach, Mgmt Sci., 16, 93, 10.1287/mnsc.16.1.93 Rhys, 1970, A selection problem of shared fixed costs and network flows, Mgmt Sci., 17, 200, 10.1287/mnsc.17.3.200