References
- Akbar, M.-M., Rahman, M., Kaykobad, M., Manning, E., & Shoja, G. (2006). Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls. Computers & Operations Research, 33(3), 1259–1273. https://doi.org/https://doi.org/10.1016/j.cor.2004.09.016
- Akeb, H., Hifi, M., & Mounir, M.-E O. A. (2011). Local branching-based algorithms for the disjunctively constrained knapsack problem. Computers & Industrial Engineering, 60(3), 811–820. https://doi.org/https://doi.org/10.1016/j.cie.2011.01.019
- Billionnet, A., & Soutif, E. (2004). An exact method for the 0-1 quadratic knapsack problem based on lagrangian decomposition. European Journal of Operational Research, 157(3), 565–575. https://doi.org/https://doi.org/10.1016/S0377-2217(03)00244-3
- Chen, Y., & Hao, J.-K. (2015). Iterated responsive threshold search for the quadratic multiple knapsack problem. Annals of Operations Research, 226(1), 101–131. https://doi.org/https://doi.org/10.1007/s10479-014-1720-5
- Chen, Y., Hao, J.-K., & Glover, F. (2016). An evolutionary path relinking approach for the quadratic multiple knapsack problem. Knowledge-Based Systems, 92, 23–34. https://doi.org/https://doi.org/10.1016/j.knosys.2015.10.004
- Cherfi, N., & Hifi, M. (2009). Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem. International Journal of Operational Research, 5(1), 89–109. https://doi.org/https://doi.org/10.1504/IJOR.2009.024531
- Fischetti, M., & Lodi, A. (2003). Local branching. Mathematical Programming, 98(1-3), 23–47. https://doi.org/https://doi.org/10.1007/s10107-003-0395-5
- Fischetti, M., Polo, C., & Scantamburlo, M. (2004). A local branching heuristic for mixed-integer programs with 2-level variables. Networks, 44(2), 61–72. https://doi.org/https://doi.org/10.1002/net.20017
- Gallo, G., Hammer, P. L., & Simeone, B. (1980). Quadratic knapsack problems. In Padberg M.W. (Eds) Combinatorial Optimization. Mathematical Programming Studies (Vol. 12). Springer.
- Garcia-Martinez, C., Glover, F., Rodriguez, F., Lozano, M., & Marti, R. (2014). Strategic oscillation for the quadratic multiple knapsack problem. Computational Optimization and Applications, 58(1), 161–185. https://doi.org/https://doi.org/10.1007/s10589-013-9623-y
- Garcia-Martinez, C., Rodriguez, F., & Lozano, M. (2014). Tabu-enhanced iterated greedy algorithm: A case study in the quadratic multiple knapsack problem. European Journal of Operational Research, 232(3), 454–463. https://doi.org/https://doi.org/10.1016/j.ejor.2013.07.035
- Glover, F. (1986). Future paths for integer programming and links to artificial intelligence. Computers & Operations Research, 13(5), 533–549. https://doi.org/https://doi.org/10.1016/0305-0548(86)90048-1
- Glover, F., & Kochenberger, G. (2002). Handbook of metaheuristics. Kluwer Academic Publishers.
- Glover, F., Laguna, M., & Marti, R. (2000). Fundamentals of scatter search and path relinking. Control and Cybernetics, 29(3), 653–684. https://doi.org/https://doi.org/10.1016/j.cie.2017.10.015
- Grange, A., Kacem, I., & Martin, S. (2019). Algorithms for the bin packing problem with overlapping items. Computers & Industrial Engineering, 115, 331–341. https://doi.org/https://doi.org/10.1016/j.cie.2017.10.015
- Hansen, P. (2006). The steepest ascent mildest descent heuristic for combinatorial programming. In Congress on Numerical Methods in Combinatorial Optimization.
- Helmberg, C., Rendl, F., & Weismantel, R. (2000). A semidefinite programming approach to the quadratic knapsack problem. Journal of Combinatorial Optimization, 4(2), 197–215. https://doi.org/https://doi.org/10.1023/A:1009898604624
- Hifi, M., & Michrafy, M. (2006). A reactive search-based algorithm for the disjunctively knapsack problem. Journal of the Operational Research Society, 57(6), 718–726. https://doi.org/https://doi.org/10.1057/palgrave.jors.2602046
- Hiley, A., & Julstrom, B. (2006). The quadratic multiple knapsack problem and three heuristic approaches to it. In Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation (GECCO ’06) (pp. 547–552). https://doi.org/https://doi.org/10.1145/1143997.1144096
- Hung, M., & Fisk, J. (1978). An algorithm for 0-1 multiple-knapsack problems. Naval Research Logistics Quarterly, 25(3), 571–579. https://doi.org/https://doi.org/10.1002/nav.3800250316
- Kellerer, H., Pferschy, U., & Pisinger, D. (2004). Knapsack problems. Springer.
- Li, Z., Cil, Z. A., Mete, S., & Kucukkoc, I. (2020). A fast branch, bound and remember algorithm for disassembly line balancing problem. International Journal of Production Research, 58(11), 3220–3234. https://doi.org/https://doi.org/10.1080/00207543.2019.1630774
- Li, Z., Kucukkoc, I., & Tang, Q. (2020). A comparative study of exact methods for the simple assembly line balancing problem. Soft Computing, 24(15), 11459–11475. https://doi.org/https://doi.org/10.1007/s00500-019-04609-9
- Lv, J., Wang, X., Huang, M., Cheng, C., & Li, F. (2016). Solving 0-1 knapsack problem by greedy degree and expectation efficiency. Applied Soft Computing, 41, 94–103. https://doi.org/https://doi.org/10.1016/j.asoc.2015.11.045
- Merkle, M., & Hellman, M. (1978). Hiding information and signatures in trapdoor knapsacks. IEEE Transactions on Information Theory, 24(5), 525–530. https://doi.org/https://doi.org/10.1109/TIT.1978.1055927
- Perboli, G., Gobbato, L., & Perfetti, F. (2014). Packing problems in transportation and supply chain: New problems and trends. Procedia - Social and Behavioral Sciences, 111, 672–681. https://doi.org/https://doi.org/10.1016/j.sbspro.2014.01.101
- Plata-Gonzalez, L., Amaya, I., Ortiz-Bayliss, J., Conant-Pablos, S., Terashima-Marin, H., & Coello-Coello, C. (2019). Evolutionary-based tailoring of synthetic instances for the knapsack problem. Soft Computing, 23, 12711–12728. https://doi.org/https://doi.org/10.1007/s00500-019-03822-w
- Rhys, J. (1970). A selection problem of shared fixed costs and network rows. Management Science, 17(3), 200–207. https://doi.org/https://doi.org/10.1287/mnsc.17.3.200
- Sara, T., Sipahioglu, A. (2007). A genetic algorithm for the quadratic multiple knapsack problem. In Proceedings of the International Symposium on Brain, Vision, and Artificial Intelligence (Vol. 10, pp. 490–498). Springer.
- Singh, A., & Baghel, A. (2007). A new grouping genetic algorithm for the quadratic multiple knapsack problem. In Cotta C., van Hemert J. (Eds.), Evolutionary Computation in Combinatorial Optimization. EvoCOP 2007. Lecture Notes in Computer Science (Vol. 4446, pp. 490–498). Springer. https://doi.org/https://doi.org/10.1007/978-3-540-71615-0_19
- Soak, S.-M., & Lee, S.-W. (2012). A memetic algorithm for the quadratic multiple container packing problem. Applied Intelligence, 36(1), 119–135. https://doi.org/https://doi.org/10.1007/s10489-010-0248-x
- Sundar, S., & Singh, A. (2010). A swarm intelligence approach to the quadratic multiple knapsack problem. In: Wong K.W., Mendis B.S.U., Bouzerdoum A. (eds) Neural Information Processing. Theory and Algorithms. ICONIP 2010. Lecture Notes in Computer Science (Vol. 6443, pp. 626–633). Springer. https://doi.org/https://doi.org/10.1007/978-3-642-17537-4_76
- Witzgall, C. (1975). Mathematical methods of site selection for electronic message systems (ems). In Applied Mathematics Division National Bureau of Standards Institute for Basic Standards Operations Research Section Washington, D. C. 20234 (Vol. NBSIR 75-737, pp. 1–40).