Nothing
Distance based bipartite matching using the RELAXIV minimum cost flow solver, oriented to matching of treatment and control groups in observational studies. Routines are provided to generate distances from generalised linear models (propensity score matching), formulas giving variables on which to limit matched distances, stratified or exact matching directives, or calipers, alone or in combination.
Package details 


Author  Ben B. Hansen <ben.hansen@umich.edu>, Mark Fredrickson <mark.m.fredrickson@gmail.com>, Josh Buckner, Josh Errickson, and Peter Solenberger, with embedded Fortran code due to Dimitri P. Bertsekas <dimitrib@mit.edu> and Paul Tseng 
Date of publication  20161230 00:13:46 
Maintainer  Mark M. Fredrickson <mark.m.fredrickson@gmail.com> 
License  file LICENSE 
Version  0.97 
URL  https://www.rproject.org https://github.com/markmfredrickson/optmatch 
Package repository  View on CRAN 
Installation 
Install the latest version of this package by entering the following in R:

Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.