Automate Time Blocking using AI

Computational Optimal Transport: A Comparison of Two Algorithms

Course Assignment Optimization algorithm for CdE events, based on Branch and Bound and the Hungarian Algorithm (mirror of an internal repository)

Multiple Object Tracker, Based on Hungarian algorithm + Kalman filter.

A implementartion of the Kuhn–Munkres algorithm or Munkres assignment algorithm, also known as the Hungarian Method. This implementation it's entirely in PyTorch

Implementation of Murty's algorithm for k-best assignments

Program to determine the minimal RMSD between two atomic configurations

Library for tracking-by-detection multi object tracking implemented in python

Some graph algorithms implemented in C/C++ and Python

A WebApp was created to solve for a case study on finding the shortest paths to deliver products and linearly assigning problem in a warehouse. The app is based on the Branch and Bound algorithm for the TSP and the Hungarian algorithm for the VAS assignment.

A Ruby gem that implements the Hungarian Algorithm in C

Bachelor's Degree Final Project

The Hungarian(Kuhn-Munkres) algorithm for Julia

The Hungarian algorithm consists of the four steps below. The first two steps are executed once, while Steps 3 and 4 are repeated until an optimal assignment is found. The input of the algorithm is an n by n square matrix with only nonnegative elements.

An object tracker for realtime multiple objects tracking

A GPU-Accelerated Clustering Algorithm that uses the Hungarian method

(Kuhn-Munkres) numpy implementation, rectangular matrix is supported (|X| <= |Y|). 100x100000 in 0.153 s.

Fruit yield estimation system using UAV

Hungarian algorithm, O(n^4) ver.

A C++ demo for Hungarian algorithm (Kuhn-Munkres algorithm).

Object Detection and Tracking using yolov3 and deepsort

This is a repository for my Diploma Thesis on Wireless Communications at Aristotle University of Thessaloniki

Take the input data of the problemfrom a text file (your input will basically be a NxN square matrix of integers and asicallydetermine how much time and memory your programs spend during runtime, and print thisinformation to the output file.(xperiments by choosing the row/column numbers of yourinput matrix as 5, 10, 100, 1000, 10000, 100000, in …

Take the input data of the problemfrom a text file (your input will basically be a NxN square matrix of integers and asicallydetermine how much time and memory your programs spend during runtime, and print thisinformation to the output file.(xperiments by choosing the row/column numbers of yourinput matrix as 5, 10, 100, 1000, 10000, 100000, in order)

Hungarian Algorithm

Evaluation of FDY orders and production plans based on optimization theory

Solving the crowdshipping problem using genetic algorithm and hungarian algorithm

3D LiDAR Object Detection & Tracking using Euclidean Clustering, RANSAC, & Hungarian Algorithm

Лаба 2.15, ГРАФ, ВЕНГЕРСКИЙ АЛГОРИТМ, vector<pair<int, int>>, зачет, Корчагин Д., ЯМП, 2 сем, 2 к, ПМИ vector<vector<int>>