Traveling salesman problem will have a total of _____different sequences.

Related MCQs

• For a salesman who has to visit n cities, following are the ways of his tour plan___.
• If primal linear programming problem has a finite solution, then dual linear programming problem should have____________.
• Maximization assignment problem is transformed into a minimization problem by_________.
• The assignment problem is a special case of transportation problem in which ______.
• If all the constraints of the primal problem in equations are of type less than or equal to then the constraints in the dual problem is ___________.
• If the primal problem has n constraints and m variables then the number of constraints in the dual problem is __________.
• Any solution to a Linear Programming Problem which also satisfies the non- negative notifications of the problem has _________.
• The similarity between assignment problem and transportation problem is _______.
• In an assignment problem involving 5 workers and 5 jobs, total number of assignments possible are _______.
• When the total demand is equal to supply then the transportation problem is said to be _________