np-hard-problems

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

Simulated annealing which uses thermodynamics of the landscape to escape local minima and works amazingly on discrete combinatorial problems

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.

Hvala: Approximate Vertex Cover Solver

Code written for lectures and homework in USC CSCI570-Analysis-of-Algorithms Course 🚀🚀🚀

Solving the N x T Scaling Collapse and other NP-Hard Search Problems via Aperture-Integral Calculus.

Salvador: Approximate Vertex Cover Solver

Esperanza: Approximate Independent Set Solver

Hybrid quantum optimization for Max-Cut and VRPTW using QUBO, QAOA, Simulated Annealing, and Google OR-Tools. QAIG Optimization Screening Assignment implemented with Qiskit and modular Python architecture.

Selected graph problems for MC558

This repository contains the code used in the CS301 (Algorithms) Project which discusses the Maximum Independent Set Problem

Proof of Concept — Universal Optimization Engine (QαT)