I have 3 managers and 5 projects. I want to assign two managers to get two projects each, and one manager gets one project to minimize the cost. How can I do that using the Hungarian method. Project 1 Project 2 Project 3 Project 4 Project 5 Manager 1 $11 $14 $6 $8 $12 Manager 2 $8 $10 $11 $6 $10 Manager 3 $9 $12 $7 $14 $8

I have 3 managers and 5 projects. I want to assign two managers to get two projects each, and one manager gets one project to minimize the cost. How can I do that using the Hungarian method. Project 1 Project 2 Project 3 Project 4 Project 5 Manager 1 $11 $14 $6 $8 $12 Manager 2 $8 $10 $11 $6 $10 Manager 3 $9 $12 $7 $14 $8

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter4: Making Decisions

Section: Chapter Questions

Problem 15RQ

See similar textbooks

Similar questions

You are provided a list of projects and a list of dependencies (a list of pairings of projects in which the second project is reliant on the first). Before a project can be constructed, all of its dependencies must be built. Find a construction order that will allow the projects to be completed. Return an error if there is no proper construction order.EXAMPLEInput:projects: a, b, c, d, e, fdependencies: (a, d), (f, b), (b, d), (f, a), (d, c)Output: f, e, a, b, d, c
No one likes working on homework assignments one day after you enjoyed your party time, you realize that you have missed n homework deadlines! All the instructors were very angry at this, and they told you that the penalty will be based on your late days. So, now, you have to start working on your assignments. You have n assignments to make up, from today. For assignment i, you know you need t; days to finish it. You can only work on one assignment at a time. If you finish an assignment on day d, you can submit it immediately, and your the number of late days for that assignment is d, which is the number of points you lose for that course. Your total penalty, therefore, is the total number of late days you finally need for finishing all assignments. For example, suppose you have 3 assignments to make up, and they take time 4 days, 6 days, and 3 days, respectively. If you work on them in order, you need 4 days to finish the first assignment, and can submit it on day 4 (need 4 late…
You are provided a list of projects and a list of dependencies (a list of pairings of projects in which the second project is reliant on the first). Before a project can be constructed, all of its dependencies must be built. Find a construction order that will allow the projects to be completed. Return an error if there is no valid build order. EXAMPLEInput:projects: a, b, c, d, e, fdependencies: (a, d), (f, b), (b, d), (f, a), (d, c)Output: f, e, a, b, d, c
Who Wants to Be a MillionaireYour final project will be to create a quiz game similar to “Who Wants to bea Millionaire?”Requirements:• Your game will include 5 questions.• You will ask the user multiple choice questions (in increasing difficultyif possible).• Each question, if answered correctly, will have a point value attached toit. The point values should be as follows: 100, 200, 500, 1000, 2000.• Unlike the game on T.V., the score will be an accumulation of the pointsearned throughout the game and the user may continue if he/she answersincorrectly.Show the user’s point total after each question.• At the end of the game, the user should be given the option to play againif he/she chooses.• Include a text file called “highscore.txt” that stores the highestscoring player’s first name and score.Update the text file if the user scores the highest score.• Include at least three functions in your program.Input Validation: The user must choose valid options from menus.Grading Criteria:1.…
In JAVA, I want to do a crime rate prediction program for my senior project; how would i go about it? where do I start and what do I need in order to begin? please answer the question below in good detail please. I need to use an algorithm in java to achieve this. Present the feasibility of the crime rate prediction project?
Design a project to calculate Xt, where Xt is to be calculated either Xt= XI, or Xt= X2, or Xt=X1+X2, using Check Boxes for selection, and according to the following equations: XI-F'+R'+u, X2- R²+D°+v, u= 2D +P, v=F-2P Private Sub Commandl_Click () Dim F, R, D, P, u, v, X1, X2, Xt as single F=Val (Textl. Text) R= Val (Text2.Text) D= Val (Text3.Text) P= Val (Text4.Text) If Check1.Value = 1 Then u= 2*D +P X1 = F^3 + R^2 +u End If If Check2.Value = 1 Then v=F-2* P X2 = R^3 + D^2 +v End If Xt =X1+X2 Text5.Text =Xt End Sub True False
Help, I making a elevator simulator. Can someone please help me improve this code I have. The remaining code is in the pictures. Any help is appreciated. Thank You! The simulation should have 4 types of Passengers: Standard: This is the most common type of passenger and has a request percentage of 70%. Standard passengers have no special requirements. VIP: This type of passenger has a request percentage of 10%. VIP passengers are given priority and are more likely to be picked up by express elevators. Freight: This type of passenger has a request percentage of 15%. Freight passengers have large items that need to be transported and are more likely to be picked up by freight elevators. Glass: This type of passenger has a request percentage of 5%. Glass passengers have fragile items that need to be transported and are more likely to be picked up by glass elevators. The simulation should also have 4 types of Elevators: StandardElevator: This is the most common type of elevator…
You have a group of friends coming to visit for your high school reunion, and you want to take them out to eat at a local restaurant. You are not sure if any of them have dietary restrictions, but your restaurant choices are as follows: Joe’s Gourmet Burgers—Vegetarian: No, Vegan: No, Gluten-Free: No Main Street Pizza Company—Vegetarian: Yes, Vegan: No, Gluten-Free: Yes Corner Café—Vegetarian: Yes, Vegan: Yes, Gluten-Free: Yes Write a program that asks whether any members of your party are vegetarian, vegan, or gluten-free, to which then displays only the restaurants to which you may take the group.
From a list of bid bonds, find out whether the bonds can be equally divided between 2 people with same value. Output explanation: Sample 1 yes: sum 2,782,351,934, 1 st person: {10022120, 2343520822, 428808992}, 2nd person: {2779943396, 2408538} Sample 2 no: there’s no possibility to equally divide the bid bonds. Design an algorithm using C language! (PS: use dynamic programming algorithm)
You need to take a trip by car to another town that you have never visited before. Therefore, you are studying a map to determine the shortest route to your destination. Depending on which route you choose, there are five other towns (call them A, B, C, D, E) that you might pass through on the way. The map shows the mileage along each road that directly connects two towns without any intervening towns. These numbers are summarized in the following table, where a dash indicates that there is no road directly connecting these two towns without going through any other towns. Miles between Adjacent Towns Town A B C DE Destination Origin A 40 60 50 10 70 B 20 55 40 50 10 D 60 E 80 (a) Formulate this problem as a shortest-path problem by drawing a network where nodes represent towns, links represent roads, and numbers indicate the length of each link in miles. (b) Use the Dijkstra's algorithm to solve this shortest path problem.
You need to take a trip by car to another town that you have never visited before. Therefore, you are studying a map to determine the shortest route to your destination. Depending on which route you choose, there are five other towns (call them A, B, C, D, E) that you might pass through on the way. The map shows the mileage along each road that directly connects two towns without any intervening towns. These numbers are summarized in the following table, where a dash indicates that there is no road directly connecting these two towns without going through any other towns. Town Origin A B C D E A 40 Miles between Adjacent Towns C D E B 60 10 50 20 - 70 55 - 88811 40 50 10 Destination | | || 88 60 80 (a) Formulate this problem as a shortest-path problem by drawing a network where nodes represent towns, links represent roads, and numbers indicate the length of each link in miles. (b) Use the Dijkstra's algorithm to solve this shortest path problem. Illustrate your work by using a table.…
MSIT 501/BMME 8050 Project #1 Description: You are working for a carpeting and flooring company. You need a program to create an estimate for customers. There are three types of rooms that customers might have: square, rectangle and circle. Yes, some people have houses with rooms that are circles. The program should ask for the customer’s name and address. Then ask for the dimensions of the room, in feet. It should then determine the cost to put flooring in the room. We compute flooring based upon the area of the room in square feet. Flooring material costs $2.00 per square feet and installation costs $1.50 per square foot. The equations for calculating the square footage of rooms are as follows: • Square: area = side1 ^ 2 • Rectangle: area = side1 * side2 • Circle: area = radius ^ 2 * pi Once the user has entered the information, the program should print out the customer information. Then it should print the total square feet in the room followed by the estimate for the materials and…