Which of the following techniques is not discussed in Chapter 11?
A) shortest-route
B) maximal-flow
C) linear programming
D) minimal-flow
E) minimal-spanning tree
Correct Answer:
Verified
Q3: The maximal-flow technique would be helpful to
Q9: Lines connecting nodes on a network are
Q10: The shortest-route technique is the same as
Q13: The minimal-spanning tree technique finds the shortest
Q15: In the minimal-spanning tree technique, it is
Q25: Which of the following problems can be
Q43: All the nodes must be connected in
Q61: The final node or destination in a
Q65: The origin or beginning node in a
Q73: The second step in the maximal-flow technique
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents