ORC Resource Number #1213Expand All
Outel Semiconductor: Recruiting CircuitBest Practice

http://www.hsor.org/modules.cfm?name=Outel_Semiconductor
PROFESSIONAL COMMENTARY 

Students explore a variation of the traveling salesman problem based on cost: What is the cheapest path through a network that will hit all nodes and return to the starting point? Activity sheets guide students through a brute-force approach and then a nearest-neighbor algorithm to find the cheapest route for a college recruiter to follow in visiting several cities. Students discover that the brute-force method always provides the optimal solution but is too inefficient to use in most applications. A 30-page resource for the teacher provides background to the lesson, describes several extensions including adding a city to an already established route, and poses a number of real-life business applications. Blackline masters, complete solutions to problems, and Internet extensions are also included. (sw)

CAREER APPLICATION 

With this lesson, career-technical students can discover that using a mathematics algorithm provides the best and simplest solution to this complex problem. One of the lesson's values is that students can see the difference between the brute-force approach to a complicated problem and the use of an established algorithm. Career-technical teachers might want to find an application of networking theory in their content area.

OHIO STANDARDSExpand All
Mathematics Academic Content Standards
Measurement Standard
Patterns, Functions and Algebra Standard
Data Analysis and Probability Standard
Mathematical Processes Standard
NATIONAL STANDARDSExpand All
Principles and Standards for School Mathematics
Algebra Standard
Geometry Standard
Problem Solving Standard
Connections Standard
Resource Information
RESOURCE TYPE
Instructional Resource
PRACTICE LEVEL
Best Practice
STANDARDS ALIGNMENT
Grades 8 - 12
CAREER FIELDS
Construction Technologies;
Finance;
Hospitality & Tourism;
Manufacturing Technologies;
Transportation Systems;
General Career Skills
TOPICS
Mathematics --
Discrete Mathematics;
Connections, applications;
Problem Solving
FOUND IN
Standards First
KEYWORDS
Hamiltonian path;
network;
graph theory;
path;
Dijkstra's algorithm
Author: Kenneth Chelst and Tom Edwards
Publisher: High School Operations Research