Classic Lagrangian may not be applicable to the traveling salesman problem
Data Structures and Algorithms
2014-05-07 v1
Abstract
In this short note, the dual problem for the traveling salesman problem is constructed through the classic Lagrangian. The existence of optimality conditions is expressed as a corresponding inverse problem. A general 4-cities instance is given, and the numerical experiment shows that the classic Lagrangian may not be applicable to the traveling salesman problem.
Keywords
Cite
@article{arxiv.1405.1298,
title = {Classic Lagrangian may not be applicable to the traveling salesman problem},
author = {Michael X. Zhou},
journal= {arXiv preprint arXiv:1405.1298},
year = {2014}
}
Comments
7 pages