摘要: … Here, optimal matched samples are obtained using network flow theory. In … optimal matched-pair samples, this approach yields optimal constructions for several statistical matching …
jstor.org 
sci-hub.se 参考文章(31)
W. G. Cochran, S. Paul Chambers, The Planning of Observational Studies of Human Populations Journal of the Royal Statistical Society: Series A (General). ,vol. 128, pp. 234- 255 ,(1965) , 10.2307/2344179
Paul R. Rosenbaum, Permutation Tests for Matched Pairs with Adjustments for Covariates Applied Statistics. ,vol. 37, pp. 401- 411 ,(1988) , 10.2307/2347314
Kurt Mehlhorn, Grzegorz Rozenberg, Wilfried Brauer, Arto Salomaa, Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness ,(1987)
William G. Cochran, Donald B. Rubin, Controlling Bias in Observational Studies: A Review Matched Sampling for Causal Effects. pp. 30- 58 ,(1974) , 10.1017/CBO9780511810725.005
Robert Endre Tarjan, Data Structures and Network Algorithms ,(1983)
Bernhard Korte, Dirk Hausmann, An Analysis of the Greedy Heuristic for Independence Systems Annals of discrete mathematics. ,vol. 2, pp. 65- 74 ,(1978) , 10.1016/S0167-5060(08)70322-4
Aho AV, JE Hopcroft, JD Ullman, The Design and Analysis of Computer Algorithms ,(1974)
A. H. SMITH, J. D. KARK, J. C. CASSEL, G. F. S. SPEARS, ANALYSIS OF PROSPECTIVE EPIDEMIOLOGIC STUDIES BY MINIMUM DISTANCE CASE-CONTROL MATCHING American Journal of Epidemiology. ,vol. 105, pp. 567- 574 ,(1977) , 10.1093/OXFORDJOURNALS.AJE.A112421
Lester Randolph Ford, Flows in networks ,(1962)
Paul R. Rosenbaum, Donald B. Rubin, The Bias Due to Incomplete Matching Matched Sampling for Causal Effects. ,vol. 41, pp. 217- 232 ,(1985) , 10.1017/CBO9780511810725.020