Ask your own question, for FREE!
Computer Science 26 Online
OpenStudy (anonymous):

Can someone give me a clue or an idea how i should approach this problem below..

OpenStudy (anonymous):

OpenStudy (e.mccormick):

Ever looked at the traveling salesman problem? Similar basis. You end up needing to evaluate all possible combinations and pick the best. Work out a logical way to do this that will not cause repetition.

OpenStudy (anonymous):

you said i need to evaluate all possible combination and pick the best, but how will i know which one is the best combination out of the 10 combinations, also how can i determine the common solution the towers could have @e.mccormick

OpenStudy (e.mccormick):

It tells you in the document. The goal is the largest number of customers. Where you have an issue in the evaluation is overlap. You need to be sure to account for it.

OpenStudy (anonymous):

i got it somewhat, but thanks, you actually took you're time reading the problems

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!