Timeline for Solving assignment problem using Hungarian method vs min cost max flow problem
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 31, 2014 at 7:30 | history | edited | Manfred Weis | CC BY-SA 3.0 |
added 40 characters in body
|
| Oct 31, 2014 at 7:21 | history | edited | Manfred Weis | CC BY-SA 3.0 |
added proposal for handling n to m assignments with Hungarian Method; added pointer to scientific computing forum,
|
| Oct 31, 2014 at 7:16 | comment | added | Manfred Weis | @EugeneMi I just added the answer to the multiple assignment problem in an edit to my answer. I hope that is of any help to you. | |
| Oct 31, 2014 at 7:14 | history | edited | Manfred Weis | CC BY-SA 3.0 |
added proposal for handling n to m assignments with Hungarian Method; added pointer to scientific computing forum,
|
| Oct 30, 2014 at 23:55 | comment | added | EugeneMi | Thanks! Can the Hungarian method be used if each each node can have more than 1 "assignment"? | |
| Oct 30, 2014 at 9:13 | history | answered | Manfred Weis | CC BY-SA 3.0 |