solve_network_flow

This function solves network flow optimization problems
by calling the RELAX-IV algorithm implemented in FORTRAN
by Dimitri Bertsekas and Paul Tseng, and made available by
Sam Pimentel in the package rcbalance.

Multivariate matching in observational studies typically has two goals: 1. to construct
treated and control groups that have similar distribution of observed covariates and 2. to produce
matched pairs or sets that are homogeneous in a few priority variables. This packages implements a
network-flow-based method built around a tripartite graph that can simultaneously achieve both goals.
The package also implements a template matching algorithm using a variant of the tripartite graph
design. A brief description of the workflow and some examples are given in the vignette. A more elaborated
tutorial can be found at <https://www.researchgate.net/publication/359513837_Tutorial_for_R_Package_match2C>.

Bo Zhang

match2C

Match One Sample using Two Criteria

solve_network_flow function

<dl><dt>net</dt>
<dd>A list of five vectors: startn, endn, ucap, cost, b.</dd></dl>

Arguments

Solve a network flow problem. — solve_network_flow

<dl>

<dt>net</dt>
<dd>A list of five vectors: startn, endn, ucap, cost, b.</dd>

</dl>

solve_network_flow: Solve a network flow problem.

Description

Usage

Value

Arguments

Details