A Fast and Efficient Solution to the Backpack Problem: Revision history

27 December 2022

• curprev 06:4906:49, 27 December 2022 Ak120 talk contribs m 19,954 bytes −11 No edit summary

7 October 2022

• curprev 23:4423:44, 7 October 2022 Ak120 talk contribs m 19,965 bytes −2 →Alterations
• curprev 23:4223:42, 7 October 2022 Ak120 talk contribs m 19,967 bytes −7 →Finding the optimal solution fast
• curprev 23:4023:40, 7 October 2022 Ak120 talk contribs m 19,974 bytes +3 →The Quality
• curprev 23:4023:40, 7 October 2022 Ak120 talk contribs m 19,971 bytes +1 →General Considerations
• curprev 23:3923:39, 7 October 2022 Ak120 talk contribs m 19,970 bytes −2 →Preface

21 March 2017

• curprev 12:0412:04, 21 March 2017 Ak120 talk contribs m 19,972 bytes −262 No edit summary

14 November 2012

• curprev 00:0300:03, 14 November 2012 Martini talk contribs 20,234 bytes +33 →Conclusion

30 July 2012

• curprev 04:3804:38, 30 July 2012 Martini talk contribs 20,201 bytes +20,201 Created page with "Written by Tels ==Abstract== In a backpack problem, you have different items and a limit. The items have a certain cost (e.g. size) and a certain value (e.g. resale value) ..."