There are 1 repository under np-hard topic.
Na Rinha de Algoritmos você deve utilizar suas habilidades para a criação de algoritmos eficientes para resolver problemas!
Parallel Tabu Search and Genetic Algorithm for the Job Shop Schedule Problem with Sequence Dependent Set Up Times
Repository of scripts and data for the "Robustness and resilience of complex networks" paper by Oriol Artime, Marco Grassia, Manlio De Domenico, James P. Gleeson, Hernán A. Makse, Giuseppe Mangioni, Matjaž Perc and Filippo Radicchi, published at Nature Review Physics (2024). https://doi.org/10.1038/s42254-023-00676-y
Repository of the paper "Machine learning dismantling and early-warning signals of disintegration in complex systems" by M. Grassia, M. De Domenico and G. Mangioni
Go (golang) bindings for Picosat, the satisfiability solver
A List of Papers on Theoretical Foundations of Graph Neural Networks
Implementation of classical problems in Computer Science in the Answer Set Solving dialect of Clingo.
A particle swarm optimization algorithm implementation with simultaneous pickup and drop for medicines distribution management.
Optimized Delegated Byzantine Fault Tolerance
UAV path planning using Genetic Algorithm
A hybrid genetic algorithm for the job shop scheduling problem
Problem Solving: A Practical Workbook
Feasibility Intensive Genetic Algorithm (FIGA) for the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW)
Part of the greedy algorithm used to solve the 2018 Alibaba Tianchi Competition-Server Dispatch Competition. This method ranks 66 in the preliminary round and is ranked second in the semi-finals. It is a good starting method.
Official Implementation of the NeurIPS'23 paper 'Maximum Independent Set: Self-Training through Dynamic Programming'.
My Edinburgh Napier University Honours Project: investigating the multi-objective Capacitated Vehicle Routing Problem with Time Windows (CVRPTW).
finding a short spanning walk throw a connected graph (NP-HARD problem)
Interactive travelling salesman problem solver. Branch & bound | Simulated annealing.
Genetic algorithm implementation to solve the famous NP-hard problem - The Travelling Salesman
This repo encapsulates a Python implementation of the Simulated Annealing Algorithm to solve by means of a "minimum energy state" heuristic the NP-hard n-machines|no preemption|C_max job shop scheduling problem, considering n=2 machines and jobs having release dates. The code was designed and wrote by me. The whole heuristic design, complexity analysis, optimization, and ideas were made possible by team-working with Arianna Montironi and Chiara Panetta. The developed heuristic is the final deliverable of our project work held during the Quantitative Methods for Decision Aid 2021 Class in Politecnico di Torino.
Solving the unate and binate set covering problem
A branch-and-bound, and A* type algorithm that solves the NP Hard Scheduling problem with the highest possible performance
A challenge to make this basic closest-strings program more efficient.
All my implemented solutions of various problems of different online judges and competitions
Application Data Distribution in Edge Computing
A Quantum Approximation algorithm for finding the Max-Cut of directed weighted graphs.
Ant Colony Optimization algorithm solving Google HashCode 2020 online elimination problem
The ripple-spreading algorithm that determines all Pareto-optimal paths for the multi-category multi-objective path optimization problem.
The ripple-spreading algorithm for the k-color shortest path problem
The ripple-spreading algorithm that determines all Pareto-optimal paths from one node to all other nodes for the multi-objective shortest path problem.