Try another version of this question Get help: Box 1: Enter your answer as an integer or decimal number. Examples: 3, -4, 5.5172 Box 2: Enter your answer as an integer or decimal number. Examples: 3, -4, 5.5172
Sample of reported job titles: Associate Curator, Collections Curator, Collections Manager, Curator, Curator of Collections, Curator of Education, Exhibitions Curator, Exhibits Curator, Gallery Director, Museum Curator
SOURCE: United States. Department of Labor. "Curator." Occupational Outlook Handbook. 17 Dec. 2015. Web. 7 March 2016.
O*NET OnLine
The director of an art museum is planning to send out an exhibit to three area schools. She wants to minimize travel time. The exhibit must travel to each of the three schools once on a particular day and return to the museum after visiting each of the three schools. The travel times, in minutes, between the schools and between the museum and the schools is given in the graph.
[Graphs generated by this script: setBorder(60,30,60,30);initPicture(-10,10,-10,10); fontsize=14;fontstyle='none';marker=null;line([10,0],[6.1232339957368E-16,10]);line([10,0],[-10,1.2246467991474E-15]);line([10,0],[-1.836970198721E-15,-10]);line([6.1232339957368E-16,10],[-10,1.2246467991474E-15]);line([6.1232339957368E-16,10],[-1.836970198721E-15,-10]);line([-10,1.2246467991474E-15],[-1.836970198721E-15,-10]);fontbackground='white';fontfill='blue';text([10,0],'Museum','belowright');dot([10,0]);fontfill='red';text([7,3],'29');fontfill='red';text([-4,8.5725275940315E-16],'57');fontfill='red';text([7,-3],'48');fontfill='blue';text([6.1232339957368E-16,10],'School A','aboveright');dot([6.1232339957368E-16,10]);fontfill='red';text([-3,7],'51');fontfill='red';text([-1.1021821192326E-15,-4],'37');fontfill='blue';text([-10,1.2246467991474E-15],'School B','aboveleft');dot([-10,1.2246467991474E-15]);fontfill='red';text([-7,-3],'22');fontfill='blue';text([-1.836970198721E-15,-10],'School C','belowleft');dot([-1.836970198721E-15,-10]);]
Find the optimal solution, starting and ending at the Museum, using the Brute Force method.
minutes of travel time
Find an approximation of the optimal solution, starting and ending at the Museum, using the Nearest Neighbor method.
minutes of travel time
Enter DNE for Does Not Exist, oo for Infinity
Enter DNE for Does Not Exist, oo for Infinity