Fix and Bound: An efficient approach for solving large-scale BoxQPs
-
Updated
Jan 11, 2023 - C++
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:
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
An Exact Solver for Minimum Sum-of-Squares Clustering
This is a knapsack-problem solver via Backtracking and Branch and Bound
Branch bound algorithm for the 0-1 knapsack problem.
Abordaje del desafío NP-Completo del Problema del Viatjant de Comerç en C++ mediante metodologías algorítmicas como Greedy, Backtracking, Branch & Bound y algoritmos probabilísticos.
Problema del Viajero Vendedor (TSP) resuelto con 'branch and bound' en paralelo.
Project for the "Algorithm Design and Analysis" Curricular Unit (FEUP)
Travelling salesman problem using branch and bound.
A really simple implementation of simplex algorithm
using 2 method - "brute force" and "branch & bound" with dynamic input N*N matrix
DataStructure And Algorithm.
Phân tích thiết kế thuật toán
Binary tomography reconstruction based on branch and bound algorithm.
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."