Solving a TSP with the CPLEX C++ API.

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

The Traveling Salesman Problem with Pickups, Deliveries and Draft Limits

Exact Treedepth Solver based on Minimal Separator Enumeration

Compute the area of an arbitrary union of disks, analytically

Sequences example Low-Level to High-Level

Implementation of different types of algorithm in order to solve the Travelling Salesman Problem. It also includes performance analysis in report