Selecting a discrete portfolio

Chade, 2005, Simultaneous search, Econometrica, 74, 1293, 10.1111/j.1468-0262.2006.00705.x Dinic, 1970, Algorithm for solution of a problem of maximum flow in a network with power estimation, Sov. Math. Dokl., 11, 1277 Edmonds, 1972, Theoretical improvements in algorithmic efficiency for network flow problems, J. ACM, 19, 248, 10.1145/321694.321699 Ford, 1956, Maximal flow through a network, Canad. J. Math., 8, 399, 10.4153/CJM-1956-045-5 Gale, 1962, College admissions and the stability of marriage, Amer. Math. Monthly, 69, 9, 10.2307/2312726 Hansen, 1986, Unimodular functions, Discrete Appl. Math., 14, 269, 10.1016/0166-218X(86)90031-4 Hochbaum, 2004, Selection, provisioning, shared fixed costs, maximum closure, and implications on algorithmic methods today, Manage. Sci., 50, 709, 10.1287/mnsc.1040.0242 Milgrom, P., Segal, I., 2014. Deferred-acceptance auctions and radio spectrum reallocation. Mimeo. Reiter, 1963, Choosing an investment program among interdependent projects, Rev. Econom. Stud., 30, 32, 10.2307/2296028 Rhys, 1970, A selection problem of shared fixed costs and network flows, Manage. Sci., 17, 200, 10.1287/mnsc.17.3.200