Masmoudi, Malek; Adouani, Yassine; Jarboui, Bassem LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup. (English) Zbl 07797338 Int. Trans. Oper. Res. 31, No. 3, 1890-1916 (2024). MSC: 90-XX PDFBibTeX XMLCite \textit{M. Masmoudi} et al., Int. Trans. Oper. Res. 31, No. 3, 1890--1916 (2024; Zbl 07797338) Full Text: DOI
Wong, Kelvin Kian Loong Bridging game theory and the knapsack problem: a theoretical formulation. (English) Zbl 1398.90142 J. Eng. Math. 91, 177-192 (2015). MSC: 90C27 91A80 91B26 90C29 PDFBibTeX XMLCite \textit{K. K. L. Wong}, J. Eng. Math. 91, 177--192 (2015; Zbl 1398.90142) Full Text: DOI
Chebil, Khalil; Khemakhem, Mahdi A dynamic programming algorithm for the knapsack problem with setup. (English) Zbl 1349.90634 Comput. Oper. Res. 64, 40-50 (2015). MSC: 90C10 90C39 90B30 PDFBibTeX XMLCite \textit{K. Chebil} and \textit{M. Khemakhem}, Comput. Oper. Res. 64, 40--50 (2015; Zbl 1349.90634) Full Text: DOI
Thiongane, Babacar; Cordeau, Jean-François; Gendron, Bernard Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem. (English) Zbl 1348.90608 Comput. Oper. Res. 53, 1-8 (2015). MSC: 90C35 90B10 90C27 PDFBibTeX XMLCite \textit{B. Thiongane} et al., Comput. Oper. Res. 53, 1--8 (2015; Zbl 1348.90608) Full Text: DOI
Boyer, V.; Elkihel, M.; El Baz, D. Heuristics for the 0-1 multidimensional knapsack problem. (English) Zbl 1176.90657 Eur. J. Oper. Res. 199, No. 3, 658-664 (2009). MSC: 90C59 90C39 90C57 PDFBibTeX XMLCite \textit{V. Boyer} et al., Eur. J. Oper. Res. 199, No. 3, 658--664 (2009; Zbl 1176.90657) Full Text: DOI
Poirriez, Vincent; Yanev, Nicola; Andonov, Rumen A hybrid algorithm for the unbounded knapsack problem. (English) Zbl 1160.90642 Discrete Optim. 6, No. 1, 110-124 (2009). MSC: 90C27 90C10 PDFBibTeX XMLCite \textit{V. Poirriez} et al., Discrete Optim. 6, No. 1, 110--124 (2009; Zbl 1160.90642) Full Text: DOI
Balev, Stefan; Yanev, Nicola; Fréville, Arnaud; Andonov, Rumen A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem. (English) Zbl 1138.90015 Eur. J. Oper. Res. 186, No. 1, 63-76 (2008). MSC: 90C10 90C39 90C59 PDFBibTeX XMLCite \textit{S. Balev} et al., Eur. J. Oper. Res. 186, No. 1, 63--76 (2008; Zbl 1138.90015) Full Text: DOI
Thiongane, Babacar; Nagih, Anass; Plateau, Gérard Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem. (English) Zbl 1111.90096 Discrete Appl. Math. 154, No. 15, 2200-2211 (2006). MSC: 90C27 90B40 PDFBibTeX XMLCite \textit{B. Thiongane} et al., Discrete Appl. Math. 154, No. 15, 2200--2211 (2006; Zbl 1111.90096) Full Text: DOI
Thiongane, Babacar; Nagih, Anass; Plateau, Gérard An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual. (English) Zbl 1091.90045 Ann. Oper. Res. 139, 353-373 (2005). MSC: 90C09 90C46 PDFBibTeX XMLCite \textit{B. Thiongane} et al., Ann. Oper. Res. 139, 353--373 (2005; Zbl 1091.90045) Full Text: DOI
Fréville, Arnaud; Hanafi, Saïd The multidimensional 0-1 knapsack problem – bounds and computational aspects. (English) Zbl 1091.90042 Ann. Oper. Res. 139, 195-227 (2005). MSC: 90C09 90C59 PDFBibTeX XMLCite \textit{A. Fréville} and \textit{S. Hanafi}, Ann. Oper. Res. 139, 195--227 (2005; Zbl 1091.90042) Full Text: DOI
Eskigun, Erdem; Uzsoy, Reha; Preckel, Paul V.; Beaujon, George; Krishnan, Subramanian; Tew, Jeffrey D. Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers. (English) Zbl 1112.90361 Eur. J. Oper. Res. 165, No. 1, 182-206 (2005). MSC: 90B80 90B05 90C59 PDFBibTeX XMLCite \textit{E. Eskigun} et al., Eur. J. Oper. Res. 165, No. 1, 182--206 (2005; Zbl 1112.90361) Full Text: DOI
Fréville, Arnaud The multidimensional 0-1 knapsack problem: an overview. (English) Zbl 1045.90050 Eur. J. Oper. Res. 155, No. 1, 1-21 (2004). MSC: 90C27 90C59 90C57 PDFBibTeX XMLCite \textit{A. Fréville}, Eur. J. Oper. Res. 155, No. 1, 1--21 (2004; Zbl 1045.90050) Full Text: DOI
Toth, Paolo Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems. (English) Zbl 0969.90075 Eur. J. Oper. Res. 125, No. 2, 222-238 (2000). MSC: 90C27 90C09 90C35 PDFBibTeX XMLCite \textit{P. Toth}, Eur. J. Oper. Res. 125, No. 2, 222--238 (2000; Zbl 0969.90075) Full Text: DOI
Martello, Silvano; Pisinger, David; Toth, Paolo New trends in exact algorithms for the \(0-1\) knapsack problem. (English) Zbl 0961.90090 Eur. J. Oper. Res. 123, No. 2, 325-332 (2000). MSC: 90C27 90C09 PDFBibTeX XMLCite \textit{S. Martello} et al., Eur. J. Oper. Res. 123, No. 2, 325--332 (2000; Zbl 0961.90090) Full Text: DOI
Kellerer, Hans; Mansini, Renata; Speranza, Maria Grazia Two linear approximation algorithms for the subset-sum problem. (English) Zbl 0955.90150 Eur. J. Oper. Res. 120, No. 2, 289-296 (2000). MSC: 90C59 PDFBibTeX XMLCite \textit{H. Kellerer} et al., Eur. J. Oper. Res. 120, No. 2, 289--296 (2000; Zbl 0955.90150) Full Text: DOI
Pisinger, David A minimal algorithm for the multiple-choice knapsack problem. (English) Zbl 0904.90143 Eur. J. Oper. Res. 83, No. 2, 394-410 (1995). MSC: 90C27 90C39 90C09 90C60 PDFBibTeX XMLCite \textit{D. Pisinger}, Eur. J. Oper. Res. 83, No. 2, 394--410 (1995; Zbl 0904.90143) Full Text: DOI
Bjorndal, M. H.; Caprara, A.; Cowling, P. I.; Della Croce, F.; Lourenço, H.; Malucelli, F.; Orman, A. J.; Pisinger, D.; Rego, C.; Salazar, J. J. Some thoughts on combinatorial optimisation. (English) Zbl 0904.90137 Eur. J. Oper. Res. 83, No. 2, 253-270 (1995). MSC: 90C27 PDFBibTeX XMLCite \textit{M. H. Bjorndal} et al., Eur. J. Oper. Res. 83, No. 2, 253--270 (1995; Zbl 0904.90137) Full Text: DOI
Yanasse, Horacio Hideki; Soma, Nei Yoshihiro A new enumeration scheme for the knapsack problem. (English) Zbl 0631.90044 Discrete Appl. Math. 18, 235-245 (1987). MSC: 90C10 11D04 PDFBibTeX XMLCite \textit{H. H. Yanasse} and \textit{N. Y. Soma}, Discrete Appl. Math. 18, 235--245 (1987; Zbl 0631.90044) Full Text: DOI