Timeline for Simplified knapsack problem
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 16, 2013 at 12:38 | answer | added | Waldemar | timeline score: 3 | |
| Oct 16, 2013 at 9:54 | comment | added | Michal R. Przybylek | @GerhardPaseman, what do you mean by "This is also the Frobenius coin problem or postage stamp problem"? While the descriptions of these three problems are similar, I don't immediately see how they are equivalent. What are reductions between the above problem and the coin problem? | |
| Oct 16, 2013 at 4:42 | answer | added | batconjurer | timeline score: 0 | |
| Oct 15, 2013 at 20:35 | comment | added | Gerhard Paseman | This is also the Frobenius coin problem or postage stamp problem. Much literature exists on the web about this problem, and non trivial algorithms exist for the n=2 and n=3 case. In general, no solution better than dynamic programming exists to my knowledge. Gerhard "But There's Always Something New" Paseman, 2013.10.15 | |
| Oct 15, 2013 at 16:52 | review | First posts | |||
| Oct 15, 2013 at 16:57 | |||||
| Oct 15, 2013 at 16:40 | history | edited | user9072 | edited tags | |
| Oct 15, 2013 at 16:34 | history | asked | Leo-guest | CC BY-SA 3.0 |