The Mathematical Optimization Framework
-
Updated
Jun 24, 2024 - C++
The Mathematical Optimization Framework
Travelling salesman problem using branch and bound.
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
Soluciones a problemas de algoritmia y estructuras de datos avanzadas de las asignaturas Métodos Algorítmicos en Resolución de Problemas I y II (2021-2022).
An Exact Solver for Semi-supervised Minimum Sum-of-Squares Clustering
An Exact Solver for Minimum Sum-of-Squares Clustering
PWr, kurs Projektowanie efektywnych algorytmów, projekt nr 1
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.
Efficient implementations of simple branch and bound and dynamic programming algorithms for 0-1 and unbounded Knapsack problems.
Project for the "Algorithm Design and Analysis" Curricular Unit (FEUP)
This repository consists of the data-structures and algorithms I implemented for the lab course CSE208: Data Structures and Algorithm II Sessional.
Travelling Salesman Problem (Serial, OpenMP and MPI) implementation using Branch and Bound algorithm.
This repo contains various exact and approximation algorithm for graph correlation clustering problems.
A C++ implementation of the Branch and Bound algorithm for solving the Travelling Salesman Problem
BCP-MAPF – branch-and-cut-and-price for multi-agent path finding
Different Implementations of Wandering salesman problem
Fix and Bound: An efficient approach for solving large-scale BoxQPs
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."