Timeline for Help wrapping my head around a combinatorial optimization problem
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 21, 2015 at 23:39 | comment | added | JCL | Could you help me to formalize the problem so that I could use a solver? What are my variables exactly? | |
| Oct 20, 2015 at 23:19 | comment | added | jjohn | I don't think it's optimal. The problem is NP-Complete via reduction to Subset-Sum. As TLW, he sould try using a solver. | |
| Oct 20, 2015 at 23:14 | comment | added | bvoq | If you know the distribution of the widgets and their increments relative to each other you can simply make pairs of 2, 3 and so on. For example the you have weights from 0 to 50 and the minimum weight is 50. Then simply choose 50 & 0, 49 & 1, 48 & 2 .... | |
| Oct 20, 2015 at 23:00 | review | First posts | |||
| Oct 21, 2015 at 1:10 | |||||
| Oct 20, 2015 at 22:55 | history | answered | bvoq | CC BY-SA 3.0 |