Multiple Choice
For a salesman who has to visit n cities which of the following are the ways of his tour plan
A) n!
B) (n+1) !
C) (n-1) !
D) n
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q7: The purpose of a dummy row or
Q8: Which of the following characteristics apply to
Q9: To proceed with the MODI algorithm for
Q10: If there were n workers & n
Q11: Customer behavior in which the customer moves
Q13: While solving an assignment problem, an activity
Q14: An assignment problem is a special case
Q15: The method used for solving an assignment
Q16: An optimal solution of an assignment problem
Q17: An assignment problem can be solved by<br>A)