Detti, Paolo A new upper bound for the multiple knapsack problem. (English) Zbl 1510.90223 Comput. Oper. Res. 129, Article ID 105210, 12 p. (2021). MSC: 90C27 PDFBibTeX XMLCite \textit{P. Detti}, Comput. Oper. Res. 129, Article ID 105210, 12 p. (2021; Zbl 1510.90223) Full Text: DOI arXiv
Mancini, Simona; Ciavotta, Michele; Meloni, Carlo The multiple multidimensional knapsack with family-split penalties. (English) Zbl 1487.90562 Eur. J. Oper. Res. 289, No. 3, 987-998 (2021). MSC: 90C27 90C10 PDFBibTeX XMLCite \textit{S. Mancini} et al., Eur. J. Oper. Res. 289, No. 3, 987--998 (2021; Zbl 1487.90562) Full Text: DOI
Dell’Amico, Mauro; Delorme, Maxence; Iori, Manuel; Martello, Silvano Mathematical models and decomposition methods for the multiple knapsack problem. (English) Zbl 1430.90480 Eur. J. Oper. Res. 274, No. 3, 886-899 (2019). MSC: 90C27 90B80 PDFBibTeX XMLCite \textit{M. Dell'Amico} et al., Eur. J. Oper. Res. 274, No. 3, 886--899 (2019; Zbl 1430.90480) Full Text: DOI Link
Tönissen, D. D.; van den Akker, J. M.; Hoogeveen, J. A. Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem. (English) Zbl 1458.90564 Comput. Oper. Res. 83, 125-139 (2017). MSC: 90C27 90C15 PDFBibTeX XMLCite \textit{D. D. Tönissen} et al., Comput. Oper. Res. 83, 125--139 (2017; Zbl 1458.90564) Full Text: DOI Link
Simon, Jay; Apte, Aruna; Regnier, Eva An application of the multiple knapsack problem: the self-sufficient marine. (English) Zbl 1394.90498 Eur. J. Oper. Res. 256, No. 3, 868-876 (2017). MSC: 90C27 90C59 90B80 90C10 90B06 90B90 PDFBibTeX XMLCite \textit{J. Simon} et al., Eur. J. Oper. Res. 256, No. 3, 868--876 (2017; Zbl 1394.90498) Full Text: DOI
Laalaoui, Y.; M’Hallah, R. A binary multiple knapsack model for single machine scheduling with machine unavailability. (English) Zbl 1349.90368 Comput. Oper. Res. 72, 71-82 (2016). MSC: 90B35 90C27 PDFBibTeX XMLCite \textit{Y. Laalaoui} and \textit{R. M'Hallah}, Comput. Oper. Res. 72, 71--82 (2016; Zbl 1349.90368) Full Text: DOI
Qin, Jin; Xu, Xianhao; Wu, Qinghua; Cheng, T. C. E. Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem. (English) Zbl 1349.90720 Comput. Oper. Res. 66, 199-214 (2016). MSC: 90C27 90C20 PDFBibTeX XMLCite \textit{J. Qin} et al., Comput. Oper. Res. 66, 199--214 (2016; Zbl 1349.90720) Full Text: DOI
Chen, Yuning; Hao, Jin-Kao Iterated responsive threshold search for the quadratic multiple knapsack problem. (English) Zbl 1309.90085 Ann. Oper. Res. 226, 101-131 (2015). MSC: 90C27 90C20 90C59 PDFBibTeX XMLCite \textit{Y. Chen} and \textit{J.-K. Hao}, Ann. Oper. Res. 226, 101--131 (2015; Zbl 1309.90085) Full Text: DOI
Kataoka, Seiji; Yamada, Takeo Upper and lower bounding procedures for the multiple knapsack assignment problem. (English) Zbl 1304.90122 Eur. J. Oper. Res. 237, No. 2, 440-447 (2014). MSC: 90B80 90C27 90C59 PDFBibTeX XMLCite \textit{S. Kataoka} and \textit{T. Yamada}, Eur. J. Oper. Res. 237, No. 2, 440--447 (2014; Zbl 1304.90122) Full Text: DOI
You, Byungjun; Yamada, Takeo An exact algorithm for the budget-constrained multiple knapsack problem. (English) Zbl 1247.90200 Int. J. Comput. Math. 88, No. 16, 3380-3393 (2011). MSC: 90C10 90C27 90C57 PDFBibTeX XMLCite \textit{B. You} and \textit{T. Yamada}, Int. J. Comput. Math. 88, No. 16, 3380--3393 (2011; Zbl 1247.90200) Full Text: DOI
Fukunaga, Alex S. A branch-and-bound algorithm for hard multiple knapsack problems. (English) Zbl 1225.90104 Ann. Oper. Res. 184, 97-119 (2011). MSC: 90C27 PDFBibTeX XMLCite \textit{A. S. Fukunaga}, Ann. Oper. Res. 184, 97--119 (2011; Zbl 1225.90104) Full Text: DOI
Adewumi, A. O.; Ali, M. M. A multi-level genetic algorithm for a multi-stage space allocation problem. (English) Zbl 1190.90083 Math. Comput. Modelling 51, No. 1-2, 109-126 (2010). MSC: 90B80 90C27 90C59 68T05 PDFBibTeX XMLCite \textit{A. O. Adewumi} and \textit{M. M. Ali}, Math. Comput. Modelling 51, No. 1--2, 109--126 (2010; Zbl 1190.90083) Full Text: DOI
Wang, Zhenbo; Xing, Wenxun A successive approximation algorithm for the multiple knapsack problem. (English) Zbl 1180.90279 J. Comb. Optim. 17, No. 4, 347-366 (2009). Reviewer: Hartmut Noltemeier (Würzburg) MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{Z. Wang} and \textit{W. Xing}, J. Comb. Optim. 17, No. 4, 347--366 (2009; Zbl 1180.90279) Full Text: DOI
Yamada, Takeo; Takeoka, Takahiro An exact algorithm for the fixed-charge multiple knapsack problem. (English) Zbl 1157.90485 Eur. J. Oper. Res. 192, No. 2, 700-705 (2009). MSC: 90C10 90C27 PDFBibTeX XMLCite \textit{T. Yamada} and \textit{T. Takeoka}, Eur. J. Oper. Res. 192, No. 2, 700--705 (2009; Zbl 1157.90485) Full Text: DOI
Wilbaut, Christophe; Hanafi, Said A survey of effective heuristics and their application to a variety of knapsack problems. (English) Zbl 1163.90721 IMA J. Manag. Math. 19, No. 3, 227-244 (2008). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{C. Wilbaut} and \textit{S. Hanafi}, IMA J. Manag. Math. 19, No. 3, 227--244 (2008; Zbl 1163.90721) Full Text: DOI Link
Fukunaga, Alex S. Integrating symmetry, dominance, and bound-and-bound in a multiple knapsack solver. (English) Zbl 1142.90501 Perron, Laurent (ed.) et al., Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 5th international conference, CPAIOR 2008 Paris, France, May 20–23, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-68154-0/pbk). Lecture Notes in Computer Science 5015, 82-96 (2008). MSC: 90C57 90C27 PDFBibTeX XMLCite \textit{A. S. Fukunaga}, Lect. Notes Comput. Sci. 5015, 82--96 (2008; Zbl 1142.90501) Full Text: DOI
Fukunaga, A. S.; Korf, R. E. Bin completion algorithms for multicontainer packing, Knapsack, and covering problems. (English) Zbl 1172.90475 J. Artif. Intell. Res. (JAIR) 28, 393-429 (2007). MSC: 90C27 68W05 68M20 PDFBibTeX XMLCite \textit{A. S. Fukunaga} and \textit{R. E. Korf}, J. Artif. Intell. Res. (JAIR) 28, 393--429 (2007; Zbl 1172.90475) Full Text: arXiv
Wäscher, Gerhard; Haußner, Heike; Schumann, Holger An improved typology of cutting and packing problems. (English) Zbl 1278.90347 Eur. J. Oper. Res. 183, No. 3, 1109-1130 (2007). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{G. Wäscher} et al., Eur. J. Oper. Res. 183, No. 3, 1109--1130 (2007; Zbl 1278.90347) Full Text: DOI
Dahl, Geir; Foldnes, Njål LP based heuristics for the multiple knapsack problem with assignment restrictions. (English) Zbl 1106.90063 Ann. Oper. Res. 146, 91-104 (2006). MSC: 90C27 90B80 90C59 PDFBibTeX XMLCite \textit{G. Dahl} and \textit{N. Foldnes}, Ann. Oper. Res. 146, 91--104 (2006; Zbl 1106.90063) Full Text: DOI Link
Hifi, Mhand; Mhalla, Hedi; Sadfi, Slim Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem. (English) Zbl 1133.90386 J. Comb. Optim. 10, No. 3, 239-260 (2005). MSC: 90C27 90C31 PDFBibTeX XMLCite \textit{M. Hifi} et al., J. Comb. Optim. 10, No. 3, 239--260 (2005; Zbl 1133.90386) Full Text: DOI
Ahuja, Ravindra K.; Cunha, Claudio B. Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem. (English) Zbl 1122.90394 J. Heuristics 11, No. 5-6, 465-481 (2005). MSC: 90C27 90C59 90B40 PDFBibTeX XMLCite \textit{R. K. Ahuja} and \textit{C. B. Cunha}, J. Heuristics 11, No. 5--6, 465--481 (2005; Zbl 1122.90394) Full Text: DOI
Rego, César RAMP: a new metaheuristic framework for combinatorial optimization. (English) Zbl 1072.90570 Rego, César (ed.) et al., Metaheuristic optimization via memory and evolution. Tabu search and scatter search. Boston, MA: Kluwer Academic Publishers (ISBN 1-4020-8134-0/hbk). Operations Research/Computer Science Interfaces Series 30, 441-460 (2005). MSC: 90C59 90C27 PDFBibTeX XMLCite \textit{C. Rego}, Oper. Res./Comput. Sci. Interface Ser. 30, 441--460 (2005; Zbl 1072.90570)
Hifi, M.; Michrafy, M.; Sbihi, A. Heuristic algorithms for the multiple-choice multidimensional knapsack problem. (English) Zbl 1088.90043 J. Oper. Res. Soc. 55, No. 12, 1323-1332 (2004). MSC: 90C27 90C59 90B40 PDFBibTeX XMLCite \textit{M. Hifi} et al., J. Oper. Res. Soc. 55, No. 12, 1323--1332 (2004; Zbl 1088.90043) Full Text: DOI HAL
Fahle, Torsten; Sellmann, Meinolf Cost based filtering for the constrained knapsack problem. (English) Zbl 1013.90105 Ann. Oper. Res. 115, 73-93 (2002). MSC: 90C27 PDFBibTeX XMLCite \textit{T. Fahle} and \textit{M. Sellmann}, Ann. Oper. Res. 115, 73--93 (2002; Zbl 1013.90105) Full Text: DOI
Chen, Feng; Yao, Enyu Semi-definite relaxation algorithm of multiple knapsack problem. (English) Zbl 1006.90070 Appl. Math., Ser. B (Engl. Ed.) 17, No. 2, 241-250 (2002). MSC: 90C27 90C22 PDFBibTeX XMLCite \textit{F. Chen} and \textit{E. Yao}, Appl. Math., Ser. B (Engl. Ed.) 17, No. 2, 241--250 (2002; Zbl 1006.90070) Full Text: DOI