Timeline for Algorithm to match numbers with minimum number of moves
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 7, 2014 at 1:06 | history | edited | TCSGrad | CC BY-SA 3.0 |
Expanded answer...
|
| May 7, 2014 at 0:49 | history | edited | Yuval Filmus | CC BY-SA 3.0 |
added 4 characters in body
|
| May 7, 2014 at 0:37 | history | edited | TCSGrad | CC BY-SA 3.0 |
Corrected objective fn
|
| May 6, 2014 at 23:02 | comment | added | Raphael | Why are the constraints necessary? | |
| May 6, 2014 at 22:46 | comment | added | TCSGrad | @dc2: This would minimize the sum of the distances between each number and $x$, where $x$ is the convergent number. The constraints ensure the LP terminates quickly, and does not search over all integers! | |
| May 6, 2014 at 22:45 | comment | added | dthree | So if I understand this correctly, in my example, x would be 1 - 3, and so I would find the edit distance of 1, 2 and 3, and then do a min on that? | |
| May 6, 2014 at 22:36 | history | answered | TCSGrad | CC BY-SA 3.0 |