Meta-Heuristic Algorithm for Travelling Salesman Problem

Implements a traveling salesperson problem (TSP) approximation algorithm in order to optimize routes for package deliveries. Written in Python. Supports multiple delivery vehicles, real time changes to delivery schedules and addresses, and provides detailed status updates for each package at any time before, during, or after delivery.

A program that breaks cycles in undirected and directed graphs (with and without weights), that is, to find the minimum feedback arc set in given graphs.

Orthogonal regression polynomial approximation: no SLE, fast, high precision, no dependencies

The folder contains implemented approaches of curves fitting of Non-Specific binding of Blood Plasma proteins to the sensor surface