Suppose a Veteran Wants a Visit to All the War

question 18

Multiple Choice

Suppose a veteran wants a visit to all the war memorials in Washington, D.C. in one day. Which technique is most likely to be useful in solving this problem?

• A) Finding an Euler circuit on a graph
• B) Applying the nearest-neighbor algorithm for the traveling salesman problem
• C) Applying Kruskal's algorithm for finding a minimum-cost spanning tree for a graph
• D) None of these techniques is likely to apply

---

Definitions:

Scrap

Material that is discarded or left over from the manufacturing process, often repurposed or recycled, but sometimes considered waste.

Variable Production Cost

Costs that vary directly with the level of production output, such as materials and labor required for manufacturing.

Fixed Production Cost

Costs associated with the production process that remain unchanged, regardless of the quantity of output.

Variable Selling Expense

Costs that vary directly with the volume of sales, such as commissions and shipping charges.