## Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem

**Authors:** Mohamed Eleiche

The minimum-travel-cost algorithm is a dynamic programming algorithm to compute an exact and deterministic lower bound for the general case of the traveling salesman problem (TSP). The algorithm is presented with its mathematical proof and asymptotic analysis. It has a (n2) complexity. A program is developed for the implementation of the algorithm and successfully tested among well known TSP problems.

**Comments:** 12 Pages.

**Download:** **PDF**

### Submission history

[v1] 2016-02-13 11:02:28

**Unique-IP document downloads:** 43 times

**Add your own feedback and questions here:**

*You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.*

*
*