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/>.
Version: 1.0.0 Imports: cobalt, dplyr, optmatch, matchMulti, fields, plyr, RCurl, gtools, rcbalance, MASS, stats, methods, ggplot2, utils, rlang, rlemon Suggests: testthat (≥ 3.0.0), rrelaxiv Published: 2024-07-04 DOI: 10.32614/CRAN.package.MultiObjMatch Author: Shichao Han [cre, aut], Samuel D. Pimentel [aut] Maintainer: Shichao Han <schan21 at berkeley.edu> License: MIT + file LICENSE NeedsCompilation: no Materials: NEWS CRAN checks: MultiObjMatch results Documentation: Downloads: Linking:Please use the canonical form https://CRAN.R-project.org/package=MultiObjMatch to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4