Recent questions tagged assignment-problem / GATE Overflow for GATE CSE

3 votes

1 answer

1

UGC NET CSE | December 2014 | Part 3 | Question: 69
Five men are available to do five different jobs. From past records, the time (in hours) that each man takes to do each job is known and is given in the following table : Find out the minimum time required to complete all the jobs. $5$ $11$ $13$ $15$

Five men are available to do five different jobs. From past records, the time (in hours) that each man takes to do each job is known and is given in the following table :...

makhdoom ghaya

7.6k views

makhdoom ghaya asked Aug 2, 2016

3 votes

1 answer

2

UGC NET CSE | Junet 2015 | Part 3 | Question: 67
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 rows or columns rows + columns rows + columns -1 rows + columns +1

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 oppor...

go_editor

3.6k views

go_editor asked Aug 2, 2016

1 votes

2 answers

3

UGC NET CSE | September 2013 | Part 3 | Question: 14
An optimal assignment requires that the minimum number of horizontal and vertical lines that can be drawn to cover all zeros be equal to the number of rows or columns rows + columns rows + columns -1 rows + columns +1

An optimal assignment requires that the minimum number of horizontal and vertical lines that can be drawn to cover all zeros be equal to the number ofrows or columnsrows ...

go_editor

3.7k views

go_editor asked Jul 22, 2016

0 votes

1 answer

4

UGC NET CSE | June 2014 | Part 3 | Question: 59
The given maximization assignment problem can be converted into a minimization problem by Subtracting each entry in a column from the maximum value in that column. Subtracting each entry in the table from the maximum value in that table. Adding ... from the maximum value in that column. Adding maximum value of the table to each entry in the table.

The given maximization assignment problem can be converted into a minimization problem bySubtracting each entry in a column from the maximum value in that column.Subtract...

makhdoom ghaya

9.9k views

makhdoom ghaya asked Jul 11, 2016

2 votes

3 answers

5

UGC NET CSE | June 2012 | Part 3 | Question: 62
The optimal solution of the following assignment problem using Hungarian method is ... $\text{(A)-(I), (B)-(IV), (C)-(II), (D)-(III)}$

The optimal solution of the following assignment problem using Hungarian method is$\begin{array}{|l|l|l|l|} \hline \text{ } & \text{I} & \text{II} & \text{III} & \text{IV...

go_editor

6.5k views

go_editor asked Jul 7, 2016

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