Showing 1 - 10 of 12
Persistent link: https://www.econbiz.de/10010539360
Persistent link: https://www.econbiz.de/10012014277
Persistent link: https://www.econbiz.de/10011987303
This paper solves the binary single-constrained Knapsack Problem (KP) and undertakes a sensitivity analysis of its optimum solution. Given a knapsack of capacity c, and a set of n items, with each item j, j = 1,…,n, characterised by a weight wj and a profit pj, the binary...
Persistent link: https://www.econbiz.de/10008563657
Persistent link: https://www.econbiz.de/10005347097
Persistent link: https://www.econbiz.de/10005240916
Persistent link: https://www.econbiz.de/10005151547
Persistent link: https://www.econbiz.de/10011472322
Persistent link: https://www.econbiz.de/10012584208
Persistent link: https://www.econbiz.de/10011990130