Timeline for Smallest cost in weighted directed graph with combinations
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 31, 2017 at 5:42 | history | tweeted | twitter.com/StackCompSci/status/826304643898683393 | ||
| Jan 31, 2017 at 1:00 | vote | accept | kyle | ||
| Jan 30, 2017 at 20:33 | answer | added | D.W.♦ | timeline score: 2 | |
| Jan 30, 2017 at 19:27 | history | edited | kyle | CC BY-SA 3.0 |
added 167 characters in body; edited tags
|
| Jan 30, 2017 at 19:18 | comment | added | kyle | @D.W. if there are 20 companies bidding on 100 projects, there could be up to 2000 bids, and out of those 2000 bids nearly 400 (20% of the total) bids would be a combination/lump sum. In the combination it could contain anywhere from 1% to 100% of the projects (unfortunately this doesn't simplify the problem). It could be where a company says that they want to pay X amount for the entire deal and would do all of the projects or a company could say they would pay Y amount for a small subset of the total projects. | |
| Jan 30, 2017 at 18:42 | history | migrated | from stackoverflow.com (revisions) | ||
| Jan 30, 2017 at 17:54 | comment | added | D.W.♦ | What's teh typical number of "combination nodes" in the graph? Is it 20*100*0.20? (if there are 20 companies and 100 projects)? That seems like an overestimate and probably it should be 20*100*0.20/k where k is the average number of projects per combination, but it's not clear what k is. | |
| Jan 27, 2017 at 21:33 | comment | added | kyle | @Vikhram It could theoretically be an unlimited number of projects, but realistically it would probably be 20~ companies and 100~ projects. | |
| Jan 27, 2017 at 21:31 | comment | added | Vikhram | How many projects would you be analyzing at a given time? As in, would O(n!) be acceptable? | |
| Jan 27, 2017 at 21:21 | answer | added | David Eisenstat | timeline score: 5 | |
| Jan 27, 2017 at 20:37 | history | asked | kyle | CC BY-SA 3.0 |