Mechanical Engineering > GATE 2014 Set-4 > Industrial Engineering

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

The total number of decision variables in the objective function of an assignment problem of size n×n (n jobs and n machines) is

A

n²

B

2n

C

2n-1

D

n

Check Answer

Explanation

Correct : a

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science