The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged assignmentproblem
+3
votes
1
answer
1
UGCNETDec2014III: 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$
asked
Aug 2, 2016
in
Numerical Methods
by
makhdoom ghaya

2.4k
views
ugcnetdec2014iii
assignmentproblem
hungarianmethod
+3
votes
1
answer
2
UGCNETJune2015III: 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
asked
Aug 2, 2016
in
Optimization
by
jothee

984
views
ugcnetjune2015iii
assignmentproblem
optimization
+1
vote
2
answers
3
UGCNETSep2013III: 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
asked
Jul 22, 2016
in
Others
by
jothee

638
views
ugcnetsep2013iii
operationalresearch
assignmentproblem
0
votes
1
answer
4
UGCNETJune2014III: 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 each entry in a column from the maximum value in that column. Adding maximum value of the table to each entry in the table.
asked
Jul 11, 2016
in
Optimization
by
makhdoom ghaya

1.2k
views
ugcnetjune2014iii
optimization
assignmentproblem
+2
votes
3
answers
5
UGCNETJune2012III: 62
The optimal solution of the following assignment problem using Hungarian method is I II III IV A 8 26 17 11 B 13 28 4 26 C 38 19 18 15 D 19 26 24 10 A B C D A I II III IV B I III II IV C I III IV II D I IV II III
asked
Jul 7, 2016
in
IS&Software Engineering
by
jothee

1.7k
views
ugcnetjune2012iii
optimization
assignmentproblem
To see more, click for the
full list of questions
or
popular tags
.
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
Recent Posts
IITD MS CSE (Systems) Experience
IIT Bombay M.Tech. (RA)  Interview Experience
Interview Experience for MS(R)IIT Delhi (School of Information Technology)
How am I preparing
PGEE 2020 (CSE) Experience
Subjects
All categories
General Aptitude
(2k)
Engineering Mathematics
(8.2k)
Digital Logic
(2.9k)
Programming and DS
(5k)
Algorithms
(4.4k)
Theory of Computation
(6.2k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.4k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.5k)
Admissions
(595)
Exam Queries
(562)
Tier 1 Placement Questions
(23)
Job Queries
(71)
Projects
(19)
Unknown Category
(1k)
Recent questions tagged assignmentproblem
Recent Blog Comments
Please add this one in the list too! IISc CDS...
Very helpful. can't thank you enough! :) :)
@toxicdesire I don't remember the exact...
Will you please tell what they answered to your...
@commenter max marks for part A was 75. They did...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,345
questions
60,510
answers
201,921
comments
95,350
users