Genetic Algorithm, Particle Swarm Optimization, Simulated Annealing, Ant Colony Optimization Algorithm,Immune Algorithm, Artificial Fish Swarm Algorithm, Differential Evolution and TSP(Traveling salesman)

Resume Shortlister is an AI application based on NLP to screen and shortlist Resumes

It uses backtracking and heuristic algorithms to solve even the most extreme sudoku boards.

Determining the sizing of transistors using heuristic algorithms and logical effort to obtain optimal delay and power

This repository contains the implementation of an enhanced NSGA-II algorithm for solving the Flexible Job Shop Scheduling Problem (FJSP), focusing on multi-objective optimization. Developed as part of the Bio-Inspired Artificial Intelligence course project at the University of Trento.

Heuristic algorithms for solving the budget-constrained prize collecting Steiner forest problem.

A Python implementation of a branch-and-bound approach (plus a simple greedy heuristic) to solve a variation of the multiple knapsack problem where items have both individual and pairwise benefits.

Implementation of dynamic programming heuristics from a research paper to solve the Quadratic Knapsack Problem (QKP), with test cases and complexity analysis.

Optimal Weighted Graph Matching

📊🔄Dive into the captivating world of AI-driven gaming, where stickers of graph algorithms 📊, a dynamic blend of Dijkstra's 🌐 and bread-first search 🔍, and a thrilling twist on the minimax algorithm come together to craft an exhilarating gameplay experience🎮. Step into the future🌌, where your every move is guided by the power of heuristic AI.

Course project for CS271: Introduction to Artificial Intelligence at UC Irvine

Implementation of a meta-heuristic based on genetic algorithms applied to the famous Knapsack problem 0/1

A heuristic approach for Minimum Dominating Set which is an NP-Complete problem and analysis of speed performance and correctness.

A generalized version of the problem

Examen - Análisis y diseño de algoritmos

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