C++ implementation of algorithms for finding perfect matchings in general graphs
High Performance Map Matching with Markov Decision Processes (MDPs) and Hidden Markov Models (HMMs).
A toolbox for solving problems of equilibrium computation and identification in discrete choice and matching problems.
Unsupervised Product Matching; A product classifier algorithm that groups products into clusters of similarity based on their title using combinations.
Exchange Server
This is the dynamic matching code for the paper ``Dynamic Matching in Practice''.
学习SGM算法用，算法照搬repo[https://github.com/ethan-li-coding/SemiGlobalMatching], 相比之下实现了对应的linux平台版本
Algorithms and Data Structures course at ITMO University
My implementation of parallel b-suitors algorithm created for Concurrent Programming course at University of Warsaw (2017/2018)
Network Protocol Declaration Language
Edmonds' blossom shrinking algorithm for finding best matching in general graphs
A Google Forms CSV parser that generates lists of optimal accompaniment pairs for music departments.
Implementation of multithreaded shared memory algorithm for approximate b -Matching
This is a Stable matching program that will take N men and N women and match them using the Gale–Shapley algorithm. This program runs in O(n^2) time.
Graph Maximum Weighted Edge Matching using OpenMP
A maximum cardinality matching algorithm
Maximum weighted matching for Boost.org graph module
Pet Adoption System based on Matching Optimizations to get best possible Client-Pet matching
Add a description, image, and links to the matching-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the matching-algorithm topic, visit your repo's landing page and select "manage topics."