The column generation method is used to efficiently solve complex combinatorial problems as diverse as cutting metal bars, designing personnel shifts, routing vehicles, scheduling production or planning site visits by sales or maintenance teams. In this article, we will use a simple example to explain how this method works.
Game theory can provide a valuable point of view for decision making. On a daily basis, each company faces complex decisions about its operations. For some of these decisions, the outcome of the decision is not conditioned by the decisions of others, but in many cases, it is. The result not only depends on the action or strategy adopted but is also affected by the decisions of others.
The travelling salesman problem (TSP) consists on finding the shortest single path that, given a list of cities and distances between them, visits all the cities only once and returns to the origin city.