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

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.

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

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.

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

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

Optimal Weighted Graph Matching

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

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

Examen - Análisis y diseño de algoritmos