Timeline for Reliability of ILP approach to number-theoretic optimization
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 28, 2022 at 17:24 | comment | added | Jukka Kohonen | On a second thought, the upwards/downwards rounding is not quite sufficient. It ensures that the true optimum is among the feasible set, but in principle we might find a slightly inferior (and also feasible) solution that happens to become "better" because of the rounding. I believe this can be remedied by doing a second search with the opposite rounding. I'll check the details and update the answer. | |
| Apr 28, 2022 at 16:44 | vote | accept | Max Alekseyev | ||
| Apr 28, 2022 at 14:53 | history | edited | Jukka Kohonen | CC BY-SA 4.0 |
be more specific about the Pentium bug
|
| Apr 28, 2022 at 14:46 | history | edited | Jukka Kohonen | CC BY-SA 4.0 |
example up to n=45 & addressing the third question
|
| Apr 28, 2022 at 11:34 | history | edited | Jukka Kohonen | CC BY-SA 4.0 |
update code
|
| Apr 27, 2022 at 13:09 | history | edited | Jukka Kohonen | CC BY-SA 4.0 |
added 94 characters in body
|
| Apr 27, 2022 at 13:01 | history | edited | Jukka Kohonen | CC BY-SA 4.0 |
deleted 8 characters in body
|
| Apr 27, 2022 at 12:56 | history | answered | Jukka Kohonen | CC BY-SA 4.0 |