Repository navigation
np-hard
- Website
- Wikipedia
OptaPy is an AI constraint solver for Python to optimize planning and scheduling problems.
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
A List of Papers on Theoretical Foundations of Graph Neural Networks
[IEEE TKDE | TITS 2023] "Learning Large Neighborhood Search for Vehicle Routing in Airport Ground Handling" | "Neural Airport Ground Handling"
Implementation of classical problems in Computer Science in the Answer Set Solving dialect of Clingo.
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.
Go (golang) bindings for Picosat, the satisfiability solver
Записките ми за упражнения по "Дизайн и анализ на алгоритми"
finding a short spanning walk throw a connected graph (NP-HARD problem)
a collection of benchmarks (in DIMACS format) for various NP-Complete problems
A particle swarm optimization algorithm implementation with simultaneous pickup and drop for medicines distribution management.
Feasibility Intensive Genetic Algorithm (FIGA) for the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW)
Official Implementation of the NeurIPS'23 paper 'Maximum Independent Set: Self-Training through Dynamic Programming'.
Optimized Delegated Byzantine Fault Tolerance
My Edinburgh Napier University Honours Project: investigating the multi-objective Capacitated Vehicle Routing Problem with Time Windows (CVRPTW).
