np-hard-problem

GCS-Q is a coalition structure generation algorithm for induced subgraph games

Complexity

A high-performance Rust library for solving the Traveling Salesman Problem (TSP) using the novel Dynamic Gravity algorithm.

Universal TSP path improver using the PCH (Position-Candidate-Hypothesis) paradigm. PCH takes ANY TSP path (from ANY algorithm), statistically analyzes it, and synthesizes a shorter path.

a browser app that calculates the precise average and standard deviation of all the choices for the np-complete problems in polynomial time. It treats the problems as a thermal dynamic system and assign probabilities to witnesses using the Boltzmann distribution. The partition function is approximated using the entropy and a Taylor expansion.

Algorithm for finding maximal cliques in hamming graph using brute force.

This project contains 3 implementations to solving the maximal clique problem.

⚛️ MIT iquHACK QuEra Challenge Submission (Winner of challenge)

Naive and optimized greedy solutions to the NP-Hard Vertex cover problem with a basic GUI

This repository contains a Java implementation of algorithms for computing Maximum Agreement Forests (MAF) on unrooted phylogenetic trees. The project is based on Chen’s classical FPT branching algorithm and extends it with the Split-or-Decompose technique introduced by Mestel et al. (2024)

Proof of concept for "TSP Escapes the O(2^n n^2) Curse" -- First improvement after more than 60 years

An evolutionary computing approach for solving instances of the NP-hard Asymmetric Traveling Salesman Problem (ATSP).

Implementation of lower and upper bound approximation algorithms for an NP-hard problem, with heuristics (Greedy, Layout) and metaheuristics (Genetic Algorithm, Simulated Annealing) to balance solution quality and efficiency