np-problem
Here are 8 public repositories matching this topic...
My Edinburgh Napier University Honours Project: investigating the multi-objective Capacitated Vehicle Routing Problem with Time Windows (CVRPTW).
-
Updated
May 30, 2022 - Python
The traveling salesman problem (TSP) is a well-known problem in theoretical computer science and operations research. The standard version of the TSP is a hard problem and belongs to the NP-Hard class. In this project, I build an application to implement the TSP by the dynamic approach and the GVNS approach .
-
Updated
Mar 11, 2023 - Python
Approximation and randomized algorithms - Assignment 01 - SAT
-
Updated
Apr 10, 2020 - Python
This Python program uses 2 main Artificial Intelligence Algorithms to solve the Best Vertex Cover Problem.
-
Updated
Nov 19, 2022 - Python
Algorithms Specialization (Stanford-Coursera)
-
Updated
Apr 4, 2020 - Python
An efficient simulated annealing algorithm applied to the Minimum Vertex Cover Problem
-
Updated
Jan 19, 2023 - Python
Feasibility Intensive Genetic Algorithm (FIGA) for the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW)
-
Updated
Jun 22, 2023 - Python
Improve this page
Add a description, image, and links to the np-problem topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the np-problem topic, visit your repo's landing page and select "manage topics."