Timeline for What algorithm can be used for a more complex version of the bin packing problem?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 30, 2015 at 19:57 | vote | accept | Nzall | ||
| Jan 16, 2015 at 8:03 | history | tweeted | twitter.com/#!/StackProgrammer/status/555998680621522944 | ||
| Jan 15, 2015 at 23:41 | comment | added | theMayer | The numbers you are talking about are small enough that the optimal solution, while N-P hard, is still feasible. Where it becomes difficult is with larger quantities. | |
| Jan 15, 2015 at 22:43 | answer | added | Karl Bielefeldt | timeline score: 4 | |
| S Jan 15, 2015 at 21:08 | history | suggested | MLM | CC BY-SA 3.0 | link brief chatting mentioned |
| Jan 15, 2015 at 21:07 | review | Suggested edits | |||
| S Jan 15, 2015 at 21:08 | |||||
| S Jan 15, 2015 at 21:03 | history | suggested | MLM | CC BY-SA 3.0 | Link the algorithm |
| Jan 15, 2015 at 21:01 | review | Suggested edits | |||
| S Jan 15, 2015 at 21:03 | |||||
| Jan 15, 2015 at 20:53 | history | asked | Nzall | CC BY-SA 3.0 |