Optimized Delegated Byzantine Fault Tolerance
-
Updated
Mar 5, 2018 - C++
Optimized Delegated Byzantine Fault Tolerance
A hybrid genetic algorithm for the job shop scheduling problem
UAV path planning using Genetic Algorithm
Application Data Distribution in Edge Computing
Ant Colony Optimization algorithm solving Google HashCode 2020 online elimination problem
All my implemented solutions of various problems of different online judges and competitions
finding a short spanning walk throw a connected graph (NP-HARD problem)
Russian Doll Search for Computing Maximum Vertex Weight Hereditary Structures in Graphs. Now with OpenMP support.
An implementation of the Particle Swarm Optimization method applied to the specific problem of Bike Sharing Redistribution
Application of a greedy heuristic to the shortest common superstring problem (SCS).
I love TSP problem, I usually use this in other topics but here need to design TSP problem to find minimum cost for moving between cities.
A program that breaks cycles in undirected and directed graphs (with and without weights), that is, to find the minimum feedback arc set in given graphs.
Traveling Salesman Problem - Explore various algorithms, approximations, and heuristics, aiming to find the most efficient and accurate solution in terms of time and results
Linear time implementation of maximum clique, maximum independent set, minimum vertex coloring, minimum clique cover and maximum weighted clique problems for chordal graphs!!!!!
Approaching the assembly line problem from an exhaustive, greedy and metaheuristic POV 🎛
Solves two variants of the Interval Scheduling Maximization Problem (ISMP): Weighted and Unwieghted.
Implementation of the data reduction rule AlmostClique by Böcker et al.. This repository is part of my bachelor thesis.
Non-Deterministic Objects library (CombView API)
A local search algorithm to solve the Minimum-Weighted Vertex Cover (MWVC) problem.
Add a description, image, and links to the np-hard topic page so that developers can more easily learn about it.
To associate your repository with the np-hard topic, visit your repo's landing page and select "manage topics."