Timeline for What is the most ``diverse'' $k$-subset of $[0, 1]^m$?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 2, 2014 at 22:08 | comment | added | user109711 | That's incredibly clear and helpful. Thank you very much for your efforts! | |
| Jun 2, 2014 at 18:42 | comment | added | Robert Israel | @user109711: I've put more material on this, including examples of mathSAT 5 input and output, and optimal solutions up to $k=16$, on my web site math.ubc.ca/~israel/packing/index.html | |
| Jun 1, 2014 at 20:39 | comment | added | user109711 | Thank you very much for these results. That would be great if I could see how your coding in mathsat5 looks like. I fail to find how to encode an optimization problem in it. | |
| Jun 1, 2014 at 20:37 | vote | accept | user109711 | ||
| Jun 1, 2014 at 20:37 | vote | accept | user109711 | ||
| Jun 1, 2014 at 20:37 | |||||
| May 28, 2014 at 22:40 | history | answered | Robert Israel | CC BY-SA 3.0 |