1. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, USA (1979)
2. Appelgate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Travelling Salesman Problem: A Computational Study. Princeton Press (2007)
3. Lecture Notes in Computer Science;R Tinós,2018
4. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack problems. Springer (2004). https://doi.org/10.1007/978-3-540-24777-7
5. Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley (1988)