findSubproblems

Get all the subproblems from a distance specification

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

findSubproblems function

<dl><dt>d</dt>
<dd>a distance specification</dd></dl>

Arguments

Author

List subproblems of a distance — findSubproblems

<dl>

<dt>d</dt>
<dd>a distance specification</dd>

</dl>

findSubproblems: List subproblems of a distance

Description

Usage

Value

Arguments

Author