Timeline for Smallest cost in weighted directed graph with combinations
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 31, 2017 at 1:00 | vote | accept | kyle | ||
| Jan 30, 2017 at 19:23 | comment | added | kyle | This is currently the approach that I will be taking; however, I feel that there are more possible/optimal solutions (even though it is NP-hard) to this problem so I would like to keep the post open. If there aren't additional suggestions, I will accept this answer. Thank you @David Eisenstat | |
| Jan 30, 2017 at 18:42 | history | migrated | from stackoverflow.com (revisions) | ||
| Jan 27, 2017 at 21:37 | comment | added | David Eisenstat | @kyle You may have trouble finding a provable optimum, but I expect that performance will be quite good. One of the nice things about integer program solvers is that they give you a posteriori bounds on how well they're doing. | |
| Jan 27, 2017 at 21:30 | comment | added | kyle | This is definitely interesting and something that I will look into, thank you. Does this handle performance well if we greatly increase the variables, say that that there are 100 companies that bid on 1000 projects? | |
| Jan 27, 2017 at 21:21 | history | answered | David Eisenstat | CC BY-SA 3.0 |