Solving a TSP with Linear Programming and Google OR-Tools in Python

In this post I show you how to solve the TSP problem using integer linear programming and Google OR-Tools for mathmatical modelling in Python. If you’re not yet familiar to the TSP and want to dig deeper, find out more here. It is one of the oldest and best explored problems in the field of… Read more Solving a TSP with Linear Programming and Google OR-Tools in Python

TSP Miller-Tucker-Zemlin Subtour Elimination Constraint

In this post we want to try to provide a solution to solve the Traveling Salesman Problem (TSP) using linear programming. The post is based on this excellent video from Mr. Michel Bierlaire at the EPFL. A good written documentation of the Miller Tucker Zemlin Constraint can be found here. What is a TSP? The… Read more TSP Miller-Tucker-Zemlin Subtour Elimination Constraint

Find optimal Solution to Knapsack Problem with Linear Programming in R

In another post I demonstrated how to develop a heuristic to solve the knapsack problem. We managed to solve the problem quite well and had an optimality gap of about 1%, that is, our solution was 1% away from the optimal solution. Here I’d like to demonstrate, how simple it is to solve the Knapsack… Read more Find optimal Solution to Knapsack Problem with Linear Programming in R