A collection of algorithms and methods for solving combinatorial optimization problems, including techniques for TSP, Knapsack, and other NP-hard problems using heuristics, metaheuristics, and exact methods

Code and data for the paper "A Combinatorial Multi-Armed Bandit Approach to Correlation Clustering", DAMI 2023

technical interview problems

Construction of Outer Isothetic Cover of 2-D Digital Object (using C)

All you need to know about your coding interview includes algorithms, data structure, oops, design patterns, recursion, graph theory, tree traversal, combinatorial problems.

Multiple Disjunctively Constrained Knapsak problem: definition and an approximation algorithm implementation.

AA Second Project - The objective of this project was to design and test a randomized algorithm to solve the combinatorial problem from the first assignment, which was to find a minimum weighted closure for a given vertex-weighted directed graph G(V, E), with n vertices and m edges. This randomized algorithm was based on the Monte Carlo algorithms.