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

MIQP solver based on OSQP

BCP-MAPF – branch-and-cut-and-price for multi-agent path finding

A JuMP-based Nonlinear Integer Program Solver

Elementary Shortest Path Problem with Resource Constraints

Java program to solve the 8 puzzle problem using branch and bound algorithm.

Python implementation of Travelling Salesman Problem (TSP) using branch-and-bound algorithm.

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

A parallel branch-and-bound engine for Python. (https://pybnb.readthedocs.io/)

Branch and Bound algorithm implemented as project for optimization course EA044.

Contains code meant to optimize the route for a tourist visiting the Louvre Museum, such that the satisfaction level is maximised by visiting all/select exhibits in a single working day.

A Python package for visualizing the geometry of linear programs.

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

β-CROWN: Efficient Bound Propagation with Per-neuron Split Constraints for Neural Network Verification

Simple implementation of spatial skyline query algorithms

A Julia framework for implementing branch-and-bound-type algorithms

OpenMP and MPI solutions for integer programming problems knapsack and travelling salesman problem using branch and bound technique

Overlapping Branch and Bound Algorithm

DRIP Numerical Optimizer is a collection of Java libraries for Numerical Optimization and Spline Functionality.

六大算法设计技巧，原文地址：http://www.srcmini.com/2594.html