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.

Empirical comparison of an exact Θ(n·2ⁿ) brute force vs. a Θ(n log n) modified greedy heuristic (provable 1/2-approximation) on the Subset Sum problem. Brute force fits 1.868ⁿ with R²=0.9955; heuristic achieves 0.9848 mean quality ratio.

Approximate Shortest Superstring Generator

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

A Java approximation algorithm for the Traveling Salesman problem (graph, nodes, edges, delivery solver).

An implementation of Chakrabarty and Goel's approximationalgorithm for the maximum budgeted allocation problem.

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