Module 8 Transportation, Assignment, and Network Algorithms

76) The first step in the maximal-flow technique is to

A) pick the node with the maximum flow.

B) pick any path with some flow.

C) eliminate any node that has a zero flow.

D) add a dummy flow from the start to the finish.

E) None of the above

Diff: 2

Topic: MAXIMAL-FLOW PROBLEM

77) The shortest-route technique would best be used to

A) assign workers to jobs in the cheapest manner.

B) determine the number of units to ship from each source to each destination.

C) determine the amount of LAN network wiring within a building.

D) minimize the amount of traffic flow on a busy highway.

E) determine the path for a truck making frequent but repeatable drops.

Diff: 2

Topic: SHORTEST-ROUTE PROBLEM

78) When using the shortest-route technique, the first step is to

A) connect the nearest node that minimizes the total distance to the origin.

B) trace the path from the warehouse to the plant.

C) determine the average distance traveled from source to end.

D) find the nearest node to the origin and put a distance box by the node.

E) None of the above

Diff: 2

Topic: SHORTEST-ROUTE PROBLEM

79) The maximal-flow technique might be used

A) to help design the moving sidewalks transporting passengers from one terminal to another in a busy airport.

B) by someone designing the traffic approaches to an airport.

C) by someone attempting to design roads that would limit the flow of traffic through an area.

D) All of the above

E) None of the above

Diff: 2

Topic: MAXIMAL-FLOW PROBLEM

80) Which of the following problems can be solved as a linear program using binary decision variables?

A) maximal-flow problem

B) shortest-route problem

C) minimal-spanning tree problem

D) A and B

E) A, B, and C

Diff: 2

Topic: SHORTEST-ROUTE PROBLEM

81) Which of the following problems can be solved as a linear program using integer decision variables?

A) maximal-flow problem

B) shortest-route problem

C) minimal-spanning tree problem

D) A and B

E) A, B, and C

Diff: 2

Topic: MAXIMAL-FLOW PROBLEM

82) The second step in the maximal-flow technique is to

A) pick the node with the maximum flow.

B) pick any path with some flow.

C) decrease the flow as much as possible.

D) add capacity to the path with minimum flow.

E) find the arc on the previously chosen path with the smallest flow capacity available.

Diff: 2

Topic: MAXIMAL-FLOW PROBLEM

83) The shortest-route technique would best be used to

A) plan the routes for a vacation driving tour.

B) plan the route for a school bus.

C) determine the path for a truck making frequent runs from a factory to a warehouse.

D) All of the above

E) None of the above

Diff: 2

Topic: SHORTEST-ROUTE PROBLEM

84) When using the shortest-route technique, the second step is to

A) find the next-nearest node to the origin and put the distance in a box by the node.

B) trace the path from the warehouse to the plant.

C) determine the average distance traveled from source to end.

D) find the nearest node to the origin and put a distance box by the node.

E) None of the above

Diff: 2

Topic: SHORTEST-ROUTE PROBLEM