balanceCosts

Create a skeleton representation of the balance edge costs
associated with pairings for a given distance and network

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

balanceCosts function

<dl><dt>net</dt>
<dd>the network structure</dd>
<dt>balance.penalty</dt>
<dd>(optional) the numeric value for balance; 1 by default</dd></dl>

Arguments

Create a skeleton representation of the balance edge costs — balanceCosts

<dl>

<dt>net</dt>
<dd>the network structure</dd>


<dt>balance.penalty</dt>
<dd>(optional) the numeric value for balance; 1 by default</dd>

</dl>

balanceCosts: Create a skeleton representation of the balance edge costs

Description

Usage

Value

Arguments