Scala library for solving NP-hard probems
-
Updated
Feb 28, 2023 - Scala
Scala library for solving NP-hard probems
Strip Packing Written in C++
With this project we researched, implemented and analyzed different algorithms to effectively and efficiently solve an NP-Complete problem such as the Minimum Vertex Cover (MVC).
Strip Packing Problem Visualizer
Solution au challenge de Winamax de 2016 hébergé sur la plateforme Codingame.
Graph, Greedy, Divide-and-Conquer and NP-Complete algorithms.
Stanford Algorithms Courses in Coursera 課程筆記
A collection of useful algorithms I am learning or have learnt and implemented to further develop my understanding!
Projects in Java and Python from class assignments
Minimal Hitting Set Solver with and without optimizations
This repository contains the files related to the paper 'Using genetic algorithms for advertising campaigns', carried out by Álvaro Seco, Natalia López and Fernando Rubio.
Add a description, image, and links to the np-complete-problems topic page so that developers can more easily learn about it.
To associate your repository with the np-complete-problems topic, visit your repo's landing page and select "manage topics."