Multiple Choice
In a shortest path problem,when "real travel" through a network can end at more than one node:
A) an arc with length 0 is inserted
B) the problem cannot be solved
C) a dummy destination is needed
D) c only
E) a and c only
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q7: In a shortest path problem there are
Q14: What is the objective of a maximum
Q16: Which of the following is not an
Q17: In a maximum flow problem, flow is
Q30: The network simplex method can aid managers
Q33: In a minimum cost flow problem, the
Q47: The model for any minimum cost flow
Q61: In a feasible minimum cost flow problem,
Q67: A minimum cost flow problem may be
Q76: Network representations can be used for financial