Nearest Insertion
Step 1. Start with a node i only.
Step 2. Find node k such that cik is minimal and form subtour i–k–i.
Step 3. Selection step. Given a subtour, find node k not in the subtour closest to any node in the subtour.
Step 4. Insertion step. Find the arc (i,j) in the subtour which minimizes cik+ckj-cij. Insert k between i and j.
Step 5. Go to step 3 unless we have a Hamiltonian cycle.