Solving the Weighted Bipartite b-Matching (WBbM) problem
-
Updated
Jul 18, 2019 - Python
Solving the Weighted Bipartite b-Matching (WBbM) problem
Implementation of multithreaded shared memory algorithm for approximate b -Matching
Implementation of Serial and Parallel Local Lazy Greedy for submodular b-matching
This repository contains a Java implementation of a Benders Decomposition algorithm to solve the Directed Robust Perfect b-Matching Problem (DRPbM). The results are part of my PhD-thesis and will be published in the near future.
Add a description, image, and links to the b-matching topic page so that developers can more easily learn about it.
To associate your repository with the b-matching topic, visit your repo's landing page and select "manage topics."