Knapsack Problem Solved Using Brute-Force, Backtrack and Branch and Bound Method for Algorithm Analysis Course in Telkom University

This is a coursework project on creating different solutions to the Traveling Salesperson Problem:

Travel Salesman Problem using Branch and Bound Algorithm, from IF2211: Algorithmic Strategy

With this project we researched, implemented and analyzed different algorithms to effectively and efficiently solve an NP-Complete problem such as the Minimum Vertex Cover (MVC).

Implemented MILP for profit optimization as part of prescriptive analytics solution for NY based Fortune 200 CPG industry partner, using branch-and-bound algorithm

Use this to determine the optimal route to go on a search for shortage struck essential commodities (gasoline, water, toilet paper etc.) using information from social media

Solve TSP in Branch and Bound approach, using Node.js (ES6)

np-complete

Programs covered in DAA Lab during Semester 4

Implementation of Branch-n-Bound algorithm for Max Clique Problem via cplex-solver

Modeling with Linear/Integer/Binary Programming & Metaheuristics

Knapsack Problem solution using two distincts aproaches: backtracking and branch-and-bound.

Solving Knapsack Problem with Branch and Bound Algorithm

The following repository shows an implementation of the branch and bound optimization. The task was part of my studies and the module "Operations Research". In cooperation with https://github.com/richard-zi

In this repository, I performed Breadth-First Search (BFS) on the Branch and Bound algorithm step by step.

Some assignments done during my undergraduate course.

Branch bound algorithm for the 0-1 knapsack problem.

Repositorio para los códigos de GAMS usados en el curso de Optimización de Procesos.

Fifteen Puzzle Solver. Made as an assignment to demonstrate the use of Branch and Bound Algorithm in IF2211 Algorithm Strategy