Nokia Bell Labs Published Computer Solutions for Traveling Salesman Problem in 1965
A 1965 publication from Nokia Bell Labs presented a computational approach to solving the well-known Traveling Salesman Problem.
On December 1, 1965, Nokia Oyj's Bell Labs research division published a mathematical paper addressing the Traveling Salesman Problem. This challenge involves finding the shortest possible route that visits a given set of cities exactly once and returns to the starting point.
The paper, titled "Computer Solutions of the Traveling Salesman Problem," outlined a mathematical framework for tackling the problem using a cost matrix. This matrix assigns a cost, such as travel time or expense, between each pair of cities, with the objective of minimizing the total cost across the entire tour.
The Traveling Salesman Problem is a fundamental example of an optimization challenge with applications spanning logistics, network design, and scheduling. The Bell Labs publication highlights the company's historical contribution to foundational research and theoretical problem-solving.
Despite its origin in 1965, the problem and its solutions remain an active area of study in computer science and operations research. Nokia Bell Labs continues its legacy of contributing to technological advancement and scientific inquiry.