RcppHungarian (Q108393): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
 
(12 intermediate revisions by 4 users not shown)
description / endescription / en
 
Solves Minimum Cost Bipartite Matching Problems
Property / programmed in
 
Property / programmed in: R / rank
Normal rank
 
Property / software version identifier
 
0.2
Property / software version identifier: 0.2 / rank
 
Normal rank
Property / software version identifier: 0.2 / qualifier
 
publication date: 26 January 2022
Timestamp+2022-01-26T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / software version identifier
 
0.1
Property / software version identifier: 0.1 / rank
 
Normal rank
Property / software version identifier: 0.1 / qualifier
 
publication date: 2 August 2019
Timestamp+2019-08-02T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / software version identifier
 
0.3
Property / software version identifier: 0.3 / rank
 
Normal rank
Property / software version identifier: 0.3 / qualifier
 
publication date: 5 September 2023
Timestamp+2023-09-05T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / maintained by
 
Property / maintained by: Justin Silverman / rank
 
Normal rank
Property / CRAN project
 
Property / CRAN project: RcppHungarian / rank
 
Normal rank
Property / programmed in
 
Property / programmed in: R / rank
 
Normal rank
Property / last update
 
5 September 2023
Timestamp+2023-09-05T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / last update: 5 September 2023 / rank
 
Normal rank
Property / description
 
Header library and R functions to solve minimum cost bipartite matching problem using Huhn-Munkres algorithm (Hungarian algorithm; <https://en.wikipedia.org/wiki/Hungarian_algorithm>; Kuhn (1955) <doi:10.1002/nav.3800020109>). This is a repackaging of code written by Cong Ma in the GitHub repo <https://github.com/mcximing/hungarian-algorithm-cpp>.
Property / description: Header library and R functions to solve minimum cost bipartite matching problem using Huhn-Munkres algorithm (Hungarian algorithm; <https://en.wikipedia.org/wiki/Hungarian_algorithm>; Kuhn (1955) <doi:10.1002/nav.3800020109>). This is a repackaging of code written by Cong Ma in the GitHub repo <https://github.com/mcximing/hungarian-algorithm-cpp>. / rank
 
Normal rank
Property / author
 
Property / author: Justin Silverman / rank
 
Normal rank
Property / copyright license
 
Property / copyright license: GNU General Public License, version 2.0 / rank
 
Normal rank
Property / copyright license
 
Property / copyright license: GNU General Public License, version 3.0 / rank
 
Normal rank
Property / copyright license: GNU General Public License, version 3.0 / qualifier
 
edition/version: expanded from: GPL (≥ 2) (English)
Property / imports
 
Property / imports: Rcpp / rank
 
Normal rank
Property / imports: Rcpp / qualifier
 
Property / cites work
 
Property / cites work: The Hungarian method for the assignment problem / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI software profile / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:56, 12 March 2024

Solves Minimum Cost Bipartite Matching Problems
Language Label Description Also known as
English
RcppHungarian
Solves Minimum Cost Bipartite Matching Problems

    Statements

    0 references
    0.2
    26 January 2022
    0 references
    0.1
    2 August 2019
    0 references
    0.3
    5 September 2023
    0 references
    0 references
    5 September 2023
    0 references
    Header library and R functions to solve minimum cost bipartite matching problem using Huhn-Munkres algorithm (Hungarian algorithm; <https://en.wikipedia.org/wiki/Hungarian_algorithm>; Kuhn (1955) <doi:10.1002/nav.3800020109>). This is a repackaging of code written by Cong Ma in the GitHub repo <https://github.com/mcximing/hungarian-algorithm-cpp>.
    0 references
    0 references
    0 references