Knapsack Problem Solved Using Brute-Force, Backtrack and Branch and Bound Method for Algorithm Analysis Course in Telkom University
-
Updated
Nov 26, 2016 - Java
Knapsack Problem Solved Using Brute-Force, Backtrack and Branch and Bound Method for Algorithm Analysis Course in Telkom University
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
Fix and Bound: An efficient approach for solving large-scale BoxQPs
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
CSP solutions using Prolog's libraries
Travelling salesman problem: Artificial Inteligence, Computer Science, Middlesex University, London
Formulating the prioritisation question as a 'knapsack problem'
Branch and bound and some problem reductions with java
Working on the Multiple Choice Knapsack Problem to design optimal packet schedulers for 5G data rates. (Jan - Feb 2020)
Instances and results from the paper.
Primeira avaliação da matéria de inteligência artificial.
KNAPSACKer is a universal toolset for solving different types of knapsack (0/1) problems, that is capable of statistical analysis and data visualization.
A software that assists a prospected proof of Gerver's conjecture, using a custom geometric branch-and-bound algorithm, and the exact rational QP solver powered by CGAL
A custom branch-and-bound algorithm for solving low-rank matrix completion to certifiable optimality
solving the Traveling Salesman Problem using Branch And Bound
Parallel machines schduling using different metaheuristic
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."