Question: a)apply the exhaustive method for the traveling backpack problem b) assume you have the following extra cities propose a greedy algorithm (not in matlab or

a)apply the exhaustive method for the traveling backpack problem
a)apply the exhaustive method for the traveling backpack problem b) assume you
b) assume you have the following extra cities
have the following extra cities propose a greedy algorithm (not in matlab
propose a greedy algorithm (not in matlab or excel) to the traveling salesman problem

\begin{tabular}{|l|l|l|l|l|} \hline Ciudad & 1 & 2 & 3 & 4 \\ \hline 1 & inf & 80 & 50 & 30 \\ \hline 2 & 80 & inf & 100 & 10 \\ \hline 3 & 50 & 100 & inf & 40 \\ \hline 4 & 30 & 10 & 40 & inf \\ \hline \end{tabular} \begin{tabular}{|l|l|l|l|l|l|l|l|l|} \hline Ciudad & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 \\ \hline 1 & inf & 80 & 50 & 30 & 6 & 8 & 9 & 10 \\ \hline 2 & 80 & inf & 100 & 10 & 11 & 2 & 3 & 5 \\ \hline 3 & 50 & 100 & inf & 40 & 7 & 9 & 11 & 2 \\ \hline 4 & 30 & 10 & 40 & inf & 5 & 7 & 12 & 1 \\ \hline 5 & 6 & 11 & 7 & 5 & inf & 33 & 2 & 22 \\ \hline 6 & 8 & 2 & 9 & 7 & 33 & inf & 9 & 12 \\ \hline 7 & 9 & 3 & 11 & 12 & 2 & 9 & inf & 7 \\ \hline 8 & 10 & 5 & 2 & 1 & 22 & 12 & 7 & inf \\ \hline \end{tabular}

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!