This project contains solutions for solving the max clique problem.
-
Updated
Apr 7, 2023 - Rust
This project contains solutions for solving the max clique problem.
Course Assignment Optimization algorithm for CdE events, based on Branch and Bound and the Hungarian Algorithm (mirror of an internal repository)
🍹Branch and bound solution using Rust to calculate an optimal cocktail ingredient list of arbitrary length 🍸
Add a description, image, and links to the branch-and-bound topic page so that developers can more easily learn about it.
To associate your repository with the branch-and-bound topic, visit your repo's landing page and select "manage topics."