Timeline for Optimization algorithm sought
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 21, 2020 at 20:04 | vote | accept | Igor Rivin | ||
| Jan 21, 2020 at 15:08 | comment | added | aorq | @GerhardPaseman: "Pick The M Biggest Ratios" doesn't always work. In the case N=3, M=2, and pairs (80,100), (20,100), and (1,20), it is best to pick the first and third pairs, even though the first and second pairs have the M biggest ratios. See my answer for a link to a good discussion. | |
| Jan 21, 2020 at 15:05 | answer | added | aorq | timeline score: 2 | |
| Jan 17, 2020 at 14:53 | history | became hot network question | |||
| Jan 17, 2020 at 2:22 | answer | added | David Eppstein | timeline score: 11 | |
| Jan 17, 2020 at 0:58 | comment | added | Gerhard Paseman | This is a mediant sum. Gerhard "Pick The M Biggest Ratios" Paseman, 2020.01.16. | |
| Jan 17, 2020 at 0:38 | answer | added | RobPratt | timeline score: 3 | |
| Jan 17, 2020 at 0:24 | history | asked | Igor Rivin | CC BY-SA 4.0 |