The Gateway to Computer Science Excellence
+3 votes
793 views

In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum  number of lines that can be drawn through squares with zero opportunity cost be equal to the number of

  1. rows or columns
  2. rows + columns
  3. rows + columns -1
  4. rows + columns +1
in Others by Veteran (105k points)
retagged by | 793 views

1 Answer

+3 votes
Best answer

ans is A 

maximum  number of lines that can be drawn through squares with zero opportunity cost be equal to the number of

rows or columns

by Boss (48.8k points)
selected by

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,645 questions
56,596 answers
195,823 comments
102,069 users