Solving a TSP with the CPLEX C++ API.

Benders decomposition with two subproblem | Integer programming

Branch-and-price solver for the Feeder Network Design Problem

The Traveling Salesman Problem with Pickups, Deliveries and Draft Limits

Travel the Same Path: A TSP Solving Strategy.

Contains approximate and exact Rieman Problem solvers for different problems that can be used for verification of CFD codes

Cyclotomic numbers for Scala, add-on for the Spire library

Exact Treedepth Solver based on Minimal Separator Enumeration

naive implementation of the CFTP algorithm and a simple Ising model simulation

Algorithms for the Black and White Knapsack Problem.

VRPSolver experiments with combinatorial lower bounds for the home health care routing and scheduling problem

Experiments in explainable AI with exact optimization tools on the MNIST image dataset.

bi-objective nonlinear integer programming problem exact algorithms

Supplements to "New solution approaches for balancing assembly lines with setup times"

非线性三目标精确算法

Playing with Runge-Kutta methods and SageMath

LSTM GRU with exact backpropagation derivation and implementation

Auctions with Budget Constraints

Implementação do problema do Caixeiro Viajante (TSP) euclidiano, utilizando um algoritmo aproximativo e um algoritmo exato. Desenvolvido junto com @Yasmin-Camargo para a disciplina de Algoritmos e Estruturas de Dados III