Timeline for Optimize / simple Set Covering Problem
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 2, 2013 at 15:36 | history | edited | user9072 |
added tags
|
|
| Jun 30, 2011 at 19:42 | comment | added | greedyplot | @Emil: Thank you for the keywords. Now I am able to find papers about this topic. | |
| Jun 30, 2011 at 19:41 | vote | accept | greedyplot | ||
| Jun 30, 2011 at 17:43 | answer | added | user9072 | timeline score: 5 | |
| Jun 30, 2011 at 13:55 | history | edited | Emil Jeřábek | CC BY-SA 3.0 |
fix formatting and some English
|
| Jun 30, 2011 at 12:22 | comment | added | greedyplot | Sorry. yes m=n. I try to improve it. | |
| Jun 30, 2011 at 12:21 | comment | added | Emil Jeřábek | The correct topic name is “additive combinatorics”. | |
| Jun 30, 2011 at 12:20 | comment | added | Gerry Myerson | Are your $m$ and $n$ supposed to be the same? | |
| Jun 30, 2011 at 11:07 | history | asked | greedyplot | CC BY-SA 3.0 |