LEMON

(Internal) Helper function for accessing algorithms in LEMON solver

Distance based bipartite matching using minimum cost flow, oriented
to matching of treatment and control groups in observational studies ('Hansen'
and 'Klopfer' 2006 <doi:10.1198/106186006X137047>). 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.

Josh Errickson

optmatch

Functions for Optimal Matching

Ben Hansen

Mark Fredrickson

Josh Buckner

Adam Rauh

LEMON function

<dl><dt>algorithm</dt>
<dd>LEMON algorithm to use. Choices are "CycleCancelling",
"CapacityScaling", "CostScaling", "NetworkSimplex". Default is
"CycleCancelling".</dd></dl>

Arguments

(Internal) Helper function for accessing algorithms in LEMON solver — LEMON

<dl>

<dt>algorithm</dt>
<dd>LEMON algorithm to use. Choices are "CycleCancelling",
"CapacityScaling", "CostScaling", "NetworkSimplex". Default is
"CycleCancelling".</dd>

</dl>

LEMON: (Internal) Helper function for accessing algorithms in LEMON solver

Description

Usage

Value

Arguments