Travelling salesman problem:Integer Programming Solution

% This code solves the travelling salesman problem.
% Part 1 data formating.
%-------------------
% n is the number pf cities.
%MATLAB linprog solver converge to global solution for n<40
% so if n>40 change solver options or use some other solver[CPLEX,GUROBI ,...] interface
%(x,y) is the cartesian coordinatea id rge cities.
% n (x,y) coordinate pairs are created randomly.
n=30;
% MATLAB intlinprog solver may not get global solution if n>40.