Preference-Aware Task Assignment in On-Demand Taxi Dispatching: An Online Stable Matching Approach
-
Updated
Apr 4, 2020 - C++
Preference-Aware Task Assignment in On-Demand Taxi Dispatching: An Online Stable Matching Approach
A cli tool for solving bipartite assignment problems.
Assignments done during CS403, Even Semester 2016-2017, IIT Mandi
SAT implementation of stable matching problem with couples and reference implementations of deferred acceptance algorithms.
Contain implementation of various algorithms, problems available online.
An implementation of stable marriage problem in C++.
hey these are some college and senior secodary projects . hope you like it
Algorithm based C++ codes. Codes includes missionary and cannibal, 8 queens, Tower of Hanoi and other algorithm based coding.
Stable matching problem applied to teachers-schools allocation problem.
Here I'm posting few C++ projects which are done based on backtracking, OOP, pointers etc. These projects were done mainly focusing on solving assignment questions of Professor Jerry Waxman's CSCI-211 - Object Oriented Programming in C++ course at CUNY QC. Posting Dr. Waxman's questions, my codes & report for those assignments & their algorithms
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.
Add a description, image, and links to the stable-marriage topic page so that developers can more easily learn about it.
To associate your repository with the stable-marriage topic, visit your repo's landing page and select "manage topics."