Timeline for Transforming an optimization problem to maxmin formulation
Current License: CC BY-SA 4.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Apr 12, 2020 at 10:01 | history | bounty ended | CommunityBot | ||
| S Apr 12, 2020 at 10:01 | history | notice removed | CommunityBot | ||
| S Apr 4, 2020 at 22:33 | history | suggested | Alex Ravsky |
Added "approximation-algorithms" tag.
|
|
| Apr 4, 2020 at 21:47 | review | Suggested edits | |||
| S Apr 4, 2020 at 22:33 | |||||
| Apr 4, 2020 at 21:44 | answer | added | Alex Ravsky | timeline score: 0 | |
| S Apr 4, 2020 at 20:07 | history | suggested | Alex Ravsky |
Added "np" tag.
|
|
| Apr 4, 2020 at 19:02 | review | Suggested edits | |||
| S Apr 4, 2020 at 20:07 | |||||
| S Apr 4, 2020 at 8:57 | history | bounty started | lchen | ||
| S Apr 4, 2020 at 8:57 | history | notice added | lchen | Authoritative reference needed | |
| Apr 4, 2020 at 1:57 | history | edited | lchen | CC BY-SA 4.0 |
added 66 characters in body
|
| Apr 2, 2020 at 13:00 | answer | added | RobPratt | timeline score: 1 | |
| Apr 2, 2020 at 10:13 | comment | added | lchen | @dohmatob Thank you. Any idea on approximation algorithms? | |
| Apr 2, 2020 at 9:50 | comment | added | dohmatob | Looks like an NP-hard problem to me... | |
| Apr 2, 2020 at 7:27 | comment | added | lchen | After thinking over the problem, the transformation is impossible. Now the problem is how to solve the original problem, i.e., maximize $\prod_{j=1}^n\sum_{a_i\in S_i} a_i$ | |
| Apr 2, 2020 at 4:20 | history | asked | lchen | CC BY-SA 4.0 |