Publisher
Springer International Publishing
Reference10 articles.
1. Averbakh, I.: Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms. Math. Program. 65, 311–330 (1994)
2. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
3. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004). https://doi.org/10.1007/978-3-540-24777-7
4. Loève, M.: Probability Theory I. Springer Verlag, New York, Heidelberg, Berlin (1977). https://doi.org/10.1007/978-1-4684-9464-8
5. Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley & Sons, New York (1990)