Experimental project solving Travelling Salesman Problem via genetic algorithm, hungarian method, etc. University project for class Operations Research.
📈 Welcome to the Design and Analysis of Algorithms Repository! 📚✨ Immerse yourself in a meticulously curated knowledge pool on algorithmic design and analysis. 🌐💡 Explore the intricacies of crafting efficient algorithms and navigating problem-solving strategies. 🚀🔍 Master the art of algorithmic exploration in this dynamic space! 👨💻🧮
C#/.NET 8 solver for Linear and Integer Programming featuring Simplex, Branch & Bound, Cutting Planes, sensitivity analysis, duality, special cases, and nonlinear optimization.
Here I am providing all types of codes I practiced for my DAA Endsemester Examination
This project aims to compare and analyze results from different optimization methods—MILP using branch and bound, MILP using branch and cut, and Genetic Algorithm—to identify the best approach for selecting influencers based on engagement and cost for a marketing campaign.
Course Projects for Optimization Algorithm in USTC (2022 Spring).
📚 Comprehensive Java Algorithms Repository for DSA practice, interview preparation, and problem-solving mastery.
To associate your repository with the branch-bound-algorithm topic, visit your repo's landing page and select "manage topics."