🧙🏾♂️ Complex Algorithms and Complexity Course from the University of San Diego
-
Updated
Nov 8, 2020 - Python
🧙🏾♂️ Complex Algorithms and Complexity Course from the University of San Diego
Algorithms-Specialization from Stanford:
Homeworks done in course CS 599: Algorithms - Design, Analysis, and Implementations at Oregon State University
Coursera Data Structures and Algorithms Specialization course 5 --> Advanced Algorithms and Complexity... Code is completed in python only.
This repo contains the implementation of an heuristic to solve the Traveling Tournament Problem (TTP), as well as the implementation of the Meta-heuristics' algorithm Iterated Local Search (ILS) satisfying the predefined contraints of the NP-hard problem.
Add a description, image, and links to the np-completeness topic page so that developers can more easily learn about it.
To associate your repository with the np-completeness topic, visit your repo's landing page and select "manage topics."