np-hard
There are 118 repositories under np-hard topic.
optapy/optapy
OptaPy is an AI constraint solver for Python to optimize planning and scheduling problems.
Universidade-Livre/rinha-de-algoritmos
Na Rinha de Algoritmos você deve utilizar suas habilidades para a criação de algoritmos eficientes para resolver problemas!
mcfadd/Job_Shop_Schedule_Problem
Parallel Tabu Search and Genetic Algorithm for the Job Shop Schedule Problem with Sequence Dependent Set Up Times
NetworkDismantling/review
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
NetworkScienceLab/GDM
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
RoyalSkye/AGH
[IEEE TKDE | TITS 2023] "Learning Large Neighborhood Search for Vehicle Routing in Airport Ground Handling" | "Neural Airport Ground Handling"
jiaqingxie/Theories-of-Graph-Neural-Networks
A List of Papers on Theoretical Foundations of Graph Neural Networks
wkschwartz/pigosat
Go (golang) bindings for Picosat, the satisfiability solver
joshuaguerin/Answer-Set-Programming-Algorithms
Implementation of classical problems in Computer Science in the Answer Set Solving dialect of Clingo.
manasiladdha/ParticleSwarmOptimization
A particle swarm optimization algorithm implementation with simultaneous pickup and drop for medicines distribution management.
toduko/design-and-analysis-of-algorithms
Записките ми за упражнения по "Дизайн и анализ на алгоритми"
agilot/satapps
Scala library for solving NP-hard probems
dynaroars/npbench
a collection of benchmarks (in DIMACS format) for various NP-Complete problems
DUTFangXiang/2017HuaWei_CraftCode
2017华为软件精英挑战赛，基于C++实现非JS
LIONS-EPFL/dynamic-MIS
Official Implementation of the NeurIPS'23 paper 'Maximum Independent Set: Self-Training through Dynamic Programming'.
NeoResearch/ODBFT
Optimized Delegated Byzantine Fault Tolerance
elifBalci/uav-path-planning-ga
UAV path planning using Genetic Algorithm
kwh44/hybrid_genetic_algorithm_JSSP
A hybrid genetic algorithm for the job shop scheduling problem
maxtuno/problem-solving-book
Problem Solving: A Practical Workbook
taylorc1009/FIGA-CVRPTW
Feasibility Intensive Genetic Algorithm (FIGA) for the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW)
taylorc1009/Honours-Project
My Edinburgh Napier University Honours Project: investigating the multi-objective Capacitated Vehicle Routing Problem with Time Windows (CVRPTW).
zangzelin/Probabilistic-greedy-method-for-server-scheduling
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.
Neville-Loh/distributed-system-scheduler
A branch-and-bound, and A* type algorithm that solves the NP Hard Scheduling problem with the highest possible performance
amirHosseinEz/Graph_Theory
finding a short spanning walk throw a connected graph (NP-HARD problem)
AndrewB330/TSP-Solver
Interactive travelling salesman problem solver. Branch & bound | Simulated annealing.
chaitanyasd/geno-tsp
Genetic algorithm implementation to solve the famous NP-hard problem - The Travelling Salesman
JDGiacomantonio-98/jobShop-scheduling-simulatedAnniealing
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.
lukabe/binate-covering-problem
Solving the unate and binate set covering problem
robertvunabandi/closest-strings-challenge
A challenge to make this basic closest-strings program more efficient.
smh997/Problem-Solving
All my implemented solutions of various problems of different online judges and competitions
sravi1210/BTP-Research
Application Data Distribution in Edge Computing
Wasiq-Malik/MaxCut-QAOA
A Quantum Approximation algorithm for finding the Max-Cut of directed weighted graphs.
Wector1/ant_colony_optimization
Ant Colony Optimization algorithm solving Google HashCode 2020 online elimination problem
Xavier-MaYiMing/MCMOPOP
The ripple-spreading algorithm that determines all Pareto-optimal paths for the multi-category multi-objective path optimization problem.
Xavier-MaYiMing/The-ripple-spreading-algorithm-for-the-k-color-shortest-path-problem
The ripple-spreading algorithm for the k-color shortest path problem
Xavier-MaYiMing/The-ripple-spreading-algorithm-for-the-one-to-all-multi-objective-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.