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

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

AI constraint solver in Java to optimize the vehicle routing problem, employee rostering, task assignment, maintenance scheduling, conference scheduling and other planning problems.

A scoring program for gliding competitions striving for 100% accuracy and determinism

Branch and Bound and Branch and Bound with subestimation

Simple Branch and Bound algorithm in Python

The Mathematical Optimization Framework

GII - FSI - Práctica 1

This is my implementation of a branch and price algorithm to solve the humanitarian aid distribution problem. This problem is a VRP with a specific objective function

Verification of neural networks based on input splitting and forward propagation of symbolic intervals with fresh variables.

Command line tool for SAT solving, SMT solving in various theories, and other algorithms related to satisfiability checking.

Simple branch-and-bound algorithm for teaching/tutorial purposes: solving a knapsack problem

solving Travel Salesman Problem using genetic algorithm and branch and bound method

MIQP solver based on OSQP

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

Efficient implementations of simple branch and bound and dynamic programming algorithms for 0-1 and unbounded Knapsack problems.

Course Assignment Optimization algorithm for CdE events, based on Branch and Bound and the Hungarian Algorithm (mirror of an internal repository)

Implementation of the algorithms proposed in the research project "Exact Methods for the SARP problem". The following is the abstract of the project.

Julia prototype for solving mixed categorical optimization problems to global optimality

Comparing the performance of Brute Force, B&B and Greedy on a Labyrinth and Letter Soup

A JuMP-based Nonlinear Integer Program Solver

A quick template for branch and price prototypes

A structured and quick-to-implement template for your branch and bound prototypes!

Implementação Python do Método Simplex para otimização linear.

Python Client library for Qaekwy Operational Research Solver

Project for the "Algorithm Design and Analysis" Curricular Unit (FEUP)

This project demostrates an attempt to model an ED system by replicating multiple scenarios that will aid the optimization of the ED services through efficient resource utilization to solve overcrowding problem and reduce average waiting and service time in the ED

Instances and results from the paper.