BCP-MAPF – branch-and-cut-and-price for multi-agent path finding
-
Updated
Oct 4, 2024 - C++
BCP-MAPF – branch-and-cut-and-price for multi-agent path finding
A C++ Framework for Optimization
Elementary Shortest Path Problem with Resource Constraints
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
Hardware Accelerated Cold-Boot Attacks
Overlapping Branch and Bound Algorithm
SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
Nested branch-and-bound algorithm to solve two-dimensional orthogonal packing problems
A recombination-based matheuristic for mixed integer programming problems with binary variables
Fix and Bound: An efficient approach for solving large-scale BoxQPs - Mathematical Programming Computation
Travelling Salesman Problem (Serial, OpenMP and MPI) implementation using Branch and Bound algorithm.
Travelling Salesman Problem C++ implementation.
An exact solver for semi-supervised minimum sum-of-squares clustering
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.
Binary tomography reconstruction based on branch and bound algorithm.
KNAPSACKer is a universal toolset for solving different types of knapsack (0/1) problems, that is capable of statistical analysis and data visualization.
Branch and cut algorithm for the clique partitioning problem
A really simple implementation of simplex 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."