![]() ![]() ![]() The problem arises in sparse matrix computations. This problem can also be described as finding a minimum-weight matching in a weighted bipartite graph. The matchpairs function solves the linear assignment problem, which requires each row of a matrix to be assigned to a column in such a way that the total cost of the assignments (given by the “sum of assigned elements” of the matrix) is minimized (or maximized).
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |