flattenSkeleton

Turns a skeleton representation of edge costs in a network back
into the vector representation expected by the optimization routine. See
comment on the costSkeleton function for more details.

Matching algorithm based on network-flow structure.
Users are able to modify the emphasis on three different
optimization goals: two different distance measures and
the number of treated units left unmatched. The method is proposed by Pimentel
and Kelz (2019) <doi:10.1080/01621459.2020.1720693>.
The 'rrelaxiv' package, which provides an alternative solver for
the underlying network flow problems, carries an
academic license and is not available on CRAN, but
may be downloaded from Github at
<https://github.com/josherrickson/rrelaxiv/>.

Shichao Han

MultiObjMatch

Multi-Objective Matching Algorithm

Samuel D. Pimentel

flattenSkeleton function

<dl><dt>skeleton</dt>
<dd>the skeleton structure</dd></dl>

Arguments

Turns a skeleton representation of edge costs in a network — flattenSkeleton

<dl>

<dt>skeleton</dt>
<dd>the skeleton structure</dd>

</dl>

flattenSkeleton: Turns a skeleton representation of edge costs in a network

Description

Usage

Value

Arguments