Bruteforce, Backtracking, B&B and Greedy problem solving and cost analysis

In this project we use problem-solving algorithms and methodologies like Bruteforce, Backtracking, Greedy and Branch and Bound to analyze their performance.

SPECIFICATIONS

Language: Java

SDK: Oracle OpenJDK version 18.0.2

IDE used: IntelliJ IDEA 2022.2 (Ultimate Edition)

INSTRUCTIONS

When running the program through IntelliJ, a menu will be displayed asking which dataset you want to load. Once selected, this dataset will be used for the rest of the program for all algorithms.

Authors

[Pol Valero] (https://github.com/pol-valero)

[Alex Liu] (https://github.com/Alello23)