Dahmani, Isma; Hifi, Mhand A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs. (English) Zbl 1467.90050 Ann. Oper. Res. 298, No. 1-2, 125-147 (2021). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{I. Dahmani} and \textit{M. Hifi}, Ann. Oper. Res. 298, No. 1--2, 125--147 (2021; Zbl 1467.90050) Full Text: DOI
Hifi, Mhand; Yousef, Labib A local search-based method for sphere packing problems. (English) Zbl 1404.90140 Eur. J. Oper. Res. 274, No. 2, 482-500 (2019). MSC: 90C59 90C27 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{L. Yousef}, Eur. J. Oper. Res. 274, No. 2, 482--500 (2019; Zbl 1404.90140) Full Text: DOI
Al-Maliky, Ferhan; Hifi, Mhand; Mhalla, Hedi Sensitivity analysis of the setup knapsack problem to perturbation of arbitrary profits or weights. (English) Zbl 1391.90500 Int. Trans. Oper. Res. 25, No. 2, 637-666 (2018). MSC: 90C27 90C31 PDFBibTeX XMLCite \textit{F. Al-Maliky} et al., Int. Trans. Oper. Res. 25, No. 2, 637--666 (2018; Zbl 1391.90500) Full Text: DOI
Dahmani, Isma; Hifi, Mhand; Wu, Lei An exact decomposition algorithm for the generalized knapsack sharing problem. (English) Zbl 1346.90699 Eur. J. Oper. Res. 252, No. 3, 761-774 (2016). MSC: 90C27 90C47 PDFBibTeX XMLCite \textit{I. Dahmani} et al., Eur. J. Oper. Res. 252, No. 3, 761--774 (2016; Zbl 1346.90699) Full Text: DOI
Hifi, Mhand; Moussa, Ibrahim; Saadi, Toufik; Saleh, Sagvan An adaptive neighborhood search for \(k\)-clustering minimum bi-clique completion problems. (English) Zbl 1370.90218 Le Thi, Hoai An (ed.) et al., Modelling, computation and optimization in information systems and management sciences. Proceedings of the 3rd international conference on modelling, computation and optimization in information systems and management sciences, MCO 2015, Lorraine, France, May 11–13, 2015. Part I. Cham: Springer (ISBN 978-3-319-18160-8/pbk; 978-3-319-18161-5/ebook). Advances in Intelligent Systems and Computing 359, 15-25 (2015). MSC: 90C27 90C35 90C59 PDFBibTeX XMLCite \textit{M. Hifi} et al., Adv. Intell. Syst. Comput. 359, 15--25 (2015; Zbl 1370.90218) Full Text: DOI
Hifi, Mhand; Wu, Lei New upper bounds and exact methods for the knapsack sharing problem. (English) Zbl 1364.90292 Appl. Math. Comput. 227, 518-530 (2014). MSC: 90C27 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{L. Wu}, Appl. Math. Comput. 227, 518--530 (2014; Zbl 1364.90292) Full Text: DOI
Hifi, Mhand; Saleh, Sagvan; Wu, Lei A fast large neighborhood search for disjunctively constrained knapsack problems. (English) Zbl 1452.90268 Fouilhoux, Pierre (ed.) et al., Combinatorial optimization. Third international symposium, ISCO 2014, Lisbon, Portugal, March 5–7, 2014. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 8596, 396-407 (2014). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{M. Hifi} et al., Lect. Notes Comput. Sci. 8596, 396--407 (2014; Zbl 1452.90268) Full Text: DOI
Hifi, Mhand; Negre, Stéphane; Wu, Lei Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem. (English) Zbl 1291.90201 Int. Trans. Oper. Res. 21, No. 1, 59-79 (2014). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{M. Hifi} et al., Int. Trans. Oper. Res. 21, No. 1, 59--79 (2014; Zbl 1291.90201) Full Text: DOI
Hifi, Mhand; Mhalla, Hedi Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study. (English) Zbl 1506.90224 Discrete Optim. 10, No. 4, 320-330 (2013). MSC: 90C27 90C31 90C39 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{H. Mhalla}, Discrete Optim. 10, No. 4, 320--330 (2013; Zbl 1506.90224) Full Text: DOI
Akeb, Hakim; Hifi, Mhand Solving the circular open dimension problem by using separate beams and look-ahead strategies. (English) Zbl 1352.90078 Comput. Oper. Res. 40, No. 5, 1243-1255 (2013). MSC: 90C27 90C57 52C17 PDFBibTeX XMLCite \textit{H. Akeb} and \textit{M. Hifi}, Comput. Oper. Res. 40, No. 5, 1243--1255 (2013; Zbl 1352.90078) Full Text: DOI
Hifi, Mhand; Otmani, Nabil An algorithm for the disjunctively constrained knapsack problem. (English) Zbl 1362.90370 Int. J. Oper. Res. 13, No. 1, 22-43 (2012). MSC: 90C59 90C27 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{N. Otmani}, Int. J. Oper. Res. 13, No. 1, 22--43 (2012; Zbl 1362.90370) Full Text: DOI
Hifi, Mhand (ed.); M’hallah, Rym (ed.) Special issue on knapsack problems and applications. (English) Zbl 1251.90009 Comput. Oper. Res. 39, No. 1, 1-2 (2012). MSC: 90-06 90B80 90C10 90C27 PDFBibTeX XMLCite \textit{M. Hifi} (ed.) and \textit{R. M'hallah} (ed.), Comput. Oper. Res. 39, No. 1, 1--2 (2012; Zbl 1251.90009) Full Text: DOI
Hifi, Mhand; Saadi, Toufik A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems. (English) Zbl 1245.90104 Comput. Optim. Appl. 51, No. 2, 783-807 (2012). MSC: 90C27 90C57 90C59 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{T. Saadi}, Comput. Optim. Appl. 51, No. 2, 783--807 (2012; Zbl 1245.90104) Full Text: DOI
Hifi, Mhand; Kacem, Imed; Nègre, Stéphane; Wu, Lei A linear programming approach for the three-dimensional bin-packing problem. (English) Zbl 1274.90315 Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24–26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 993-1000 (2010). MSC: 90C27 90C05 90C11 PDFBibTeX XMLCite \textit{M. Hifi} et al., Electron. Notes Discrete Math. 36, 993--1000 (2010; Zbl 1274.90315) Full Text: Link
Hifi, Mhand; Mhalla, Hedi Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study. (English) Zbl 1237.90195 Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24–26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 439-446 (2010). MSC: 90C27 90C31 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{H. Mhalla}, Electron. Notes Discrete Math. 36, 439--446 (2010; Zbl 1237.90195) Full Text: DOI
Akeb, Hakim; Hifi, Mhand; M’Hallah, Rym Adaptive beam search lookahead algorithms for the circular packing problem. (English) Zbl 1220.90103 Int. Trans. Oper. Res. 17, No. 5, 553-575 (2010). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{H. Akeb} et al., Int. Trans. Oper. Res. 17, No. 5, 553--575 (2010; Zbl 1220.90103) Full Text: DOI
Hifi, Mhand; Saadi, Toufik A cooperative algorithm for constrained two-staged two-dimensional cutting problems. (English) Zbl 1200.90143 Int. J. Oper. Res. 9, No. 1, 104-124 (2010). MSC: 90C27 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{T. Saadi}, Int. J. Oper. Res. 9, No. 1, 104--124 (2010; Zbl 1200.90143) Full Text: DOI
Akeb, Hakim; Hifi, Mhand A hybrid beam search looking-ahead algorithm for the circular packing problem. (English) Zbl 1200.90141 J. Comb. Optim. 20, No. 2, 101-130 (2010). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{H. Akeb} and \textit{M. Hifi}, J. Comb. Optim. 20, No. 2, 101--130 (2010; Zbl 1200.90141) Full Text: DOI
Cherfi, N.; Hifi, M. A column generation method for the multiple-choice multi-dimensional knapsack problem. (English) Zbl 1190.90157 Comput. Optim. Appl. 46, No. 1, 51-73 (2010). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{N. Cherfi} and \textit{M. Hifi}, Comput. Optim. Appl. 46, No. 1, 51--73 (2010; Zbl 1190.90157) Full Text: DOI
Hifi, Mhand; M’hallah, Rym A literature review on circle and sphere packing problems: models and methodologies. (English) Zbl 1198.90337 Adv. Oper. Res. 2009, Article ID 150624, 22 p. (2009). MSC: 90C27 52C15 90-02 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{R. M'hallah}, Adv. Oper. Res. 2009, Article ID 150624, 22 p. (2009; Zbl 1198.90337) Full Text: DOI EuDML
Akeb, Hakim; Hifi, Mhand Adaptive algorithms for circular cutting/packing problems. (English) Zbl 1175.90321 Int. J. Oper. Res. 6, No. 4, 435-458 (2009). MSC: 90C27 PDFBibTeX XMLCite \textit{H. Akeb} and \textit{M. Hifi}, Int. J. Oper. Res. 6, No. 4, 435--458 (2009; Zbl 1175.90321) Full Text: DOI
Hifi, Mhand; M’Hallah, Rym Beam search and non-linear programming tools for the circular packing problem. (English) Zbl 1180.90270 Int. J. Math. Oper. Res. 1, No. 4, 476-503 (2009). MSC: 90C27 90C30 90C59 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{R. M'Hallah}, Int. J. Math. Oper. Res. 1, No. 4, 476--503 (2009; Zbl 1180.90270) Full Text: DOI
Hifi, M.; M’Hallah, R.; Saadi, T. Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem. (English) Zbl 1179.90283 Comput. Optim. Appl. 42, No. 2, 303-326 (2009). MSC: 90C27 90C39 PDFBibTeX XMLCite \textit{M. Hifi} et al., Comput. Optim. Appl. 42, No. 2, 303--326 (2009; Zbl 1179.90283) Full Text: DOI
Akeb, Hakim; Hifi, Mhand; M’hallah, Rym A beam search algorithm for the circular packing problem. (English) Zbl 1177.90330 Comput. Oper. Res. 36, No. 5, 1513-1528 (2009). MSC: 90C27 90B40 PDFBibTeX XMLCite \textit{H. Akeb} et al., Comput. Oper. Res. 36, No. 5, 1513--1528 (2009; Zbl 1177.90330) Full Text: DOI
Akeb, Hakim; Hifi, Mhand Algorithms for the circular two-dimensional open dimension problem. (English) Zbl 1377.90070 Int. Trans. Oper. Res. 15, No. 6, 685-704 (2008). MSC: 90C27 90B80 PDFBibTeX XMLCite \textit{H. Akeb} and \textit{M. Hifi}, Int. Trans. Oper. Res. 15, No. 6, 685--704 (2008; Zbl 1377.90070) Full Text: DOI
Belgacem, Tarik; Hifi, Mhand Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem. (English) Zbl 1179.90271 Discrete Optim. 5, No. 4, 755-761 (2008). MSC: 90C27 90C31 PDFBibTeX XMLCite \textit{T. Belgacem} and \textit{M. Hifi}, Discrete Optim. 5, No. 4, 755--761 (2008; Zbl 1179.90271) Full Text: DOI
Belgacem, T.; Hifi, M. Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item. (English) Zbl 1135.90407 Int. Trans. Oper. Res. 15, No. 1, 35-49 (2008). MSC: 90C31 90C27 90C47 PDFBibTeX XMLCite \textit{T. Belgacem} and \textit{M. Hifi}, Int. Trans. Oper. Res. 15, No. 1, 35--49 (2008; Zbl 1135.90407) Full Text: DOI
Hifi, Mhand; M’Hallah, Rym Adaptive and restarting techniques-based algorithms for circular packing problems. (English) Zbl 1147.90390 Comput. Optim. Appl. 39, No. 1, 17-35 (2008). MSC: 90C27 52B55 52C26 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{R. M'Hallah}, Comput. Optim. Appl. 39, No. 1, 17--35 (2008; Zbl 1147.90390) Full Text: DOI
Belgacem, T.; Hifi, M. Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item. (English) Zbl 1149.90389 Comput. Oper. Res. 35, No. 1, 295-308 (2008). MSC: 90C27 90C31 PDFBibTeX XMLCite \textit{T. Belgacem} and \textit{M. Hifi}, Comput. Oper. Res. 35, No. 1, 295--308 (2008; Zbl 1149.90389) Full Text: DOI
Hifi, M.; M’hallah, R. A dynamic adaptive local search algorithm for the circular packing problem. (English) Zbl 1135.90037 Eur. J. Oper. Res. 183, No. 3, 1280-1294 (2007). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{R. M'hallah}, Eur. J. Oper. Res. 183, No. 3, 1280--1294 (2007; Zbl 1135.90037) Full Text: DOI
Hifi, M.; Michrafy, M. Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem. (English) Zbl 1141.90512 Comput. Oper. Res. 34, No. 9, 2657-2673 (2007). MSC: 90C27 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{M. Michrafy}, Comput. Oper. Res. 34, No. 9, 2657--2673 (2007; Zbl 1141.90512) Full Text: DOI
Hifi, M.; Michrafy, M. A reactive local search-based algorithm for the disjunctively constrained knapsack problem. (English) Zbl 1151.90587 J. Oper. Res. Soc. 57, No. 6, 718-726 (2006). MSC: 90C59 90C27 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{M. Michrafy}, J. Oper. Res. Soc. 57, No. 6, 718--726 (2006; Zbl 1151.90587) Full Text: DOI
Hifi, M.; Michrafy, M.; Sbihi, A. A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem. (English) Zbl 1103.90086 Comput. Optim. Appl. 33, No. 2-3, 271-285 (2006). MSC: 90C27 90B40 90C59 PDFBibTeX XMLCite \textit{M. Hifi} et al., Comput. Optim. Appl. 33, No. 2--3, 271--285 (2006; Zbl 1103.90086) Full Text: DOI
Hifi, Mhand; M’Hallah, Rym Strip generation algorithms for constrained two-dimensional two-staged cutting problems. (English) Zbl 1120.90071 Eur. J. Oper. Res. 172, No. 2, 515-527 (2006). MSC: 90C59 90C27 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{R. M'Hallah}, Eur. J. Oper. Res. 172, No. 2, 515--527 (2006; Zbl 1120.90071) Full Text: DOI
Hifi, Mhand; M’hallah, Rym An exact algorithm for constrained two-dimensional two-staged cutting problems. (English) Zbl 1165.90539 Oper. Res. 53, No. 1, 140-150 (2005). MSC: 90B80 90C27 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{R. M'hallah}, Oper. Res. 53, No. 1, 140--150 (2005; Zbl 1165.90539) Full Text: DOI
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
Hifi, Mhand; M’Halla, Hedi; Sadfi, Slim An exact algorithm for the knapsack sharing problem. (English) Zbl 1074.90037 Comput. Oper. Res. 32, No. 5, 1311-1324 (2005). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{M. Hifi} et al., Comput. Oper. Res. 32, No. 5, 1311--1324 (2005; Zbl 1074.90037) Full Text: DOI
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
Hifi, Mhand Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems. (English) Zbl 1136.90495 J. Comb. Optim. 8, No. 1, 65-84 (2004). MSC: 90C39 90C27 90C59 90B30 PDFBibTeX XMLCite \textit{M. Hifi}, J. Comb. Optim. 8, No. 1, 65--84 (2004; Zbl 1136.90495) Full Text: DOI
Hifi, Mhand; Paschos, Vangelis Th.; Zissimopoulos, Vassilis A simulated annealing approach for the circular cutting problem. (English) Zbl 1065.90082 Eur. J. Oper. Res. 159, No. 2, 430-448 (2004). MSC: 90C59 90C27 PDFBibTeX XMLCite \textit{M. Hifi} et al., Eur. J. Oper. Res. 159, No. 2, 430--448 (2004; Zbl 1065.90082) Full Text: DOI
Hifi, Mhand; M’Hallah, Rym Approximate algorithms for constrained circular cutting problems. (English) Zbl 1061.90095 Comput. Oper. Res. 31, No. 5, 675-694 (2004). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{R. M'Hallah}, Comput. Oper. Res. 31, No. 5, 675--694 (2004; Zbl 1061.90095) Full Text: DOI
Hifi, Mhand Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study. (English) Zbl 1061.90094 Comput. Oper. Res. 31, No. 5, 657-674 (2004). MSC: 90C27 PDFBibTeX XMLCite \textit{M. Hifi}, Comput. Oper. Res. 31, No. 5, 657--674 (2004; Zbl 1061.90094) Full Text: DOI
Hifi, M.; Hallah, R. M. A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes. (English) Zbl 1087.90062 Int. Trans. Oper. Res. 10, No. 3, 195-216 (2003). MSC: 90C27 90C59 90C57 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{R. M. Hallah}, Int. Trans. Oper. Res. 10, No. 3, 195--216 (2003; Zbl 1087.90062) Full Text: DOI
Hifi, Mhand; Sadfi, Slim The knapsack sharing problem: an exact algorithm. (English) Zbl 1058.90055 J. Comb. Optim. 6, No. 1, 35-54 (2002). MSC: 90C27 90C10 90C39 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{S. Sadfi}, J. Comb. Optim. 6, No. 1, 35--54 (2002; Zbl 1058.90055) Full Text: DOI
Hifi, M. Approximate algorithms for the container loading problem. (English) Zbl 1044.90060 Int. Trans. Oper. Res. 9, No. 6, 747-774 (2002). MSC: 90C27 90C59 90C39 PDFBibTeX XMLCite \textit{M. Hifi}, Int. Trans. Oper. Res. 9, No. 6, 747--774 (2002; Zbl 1044.90060) Full Text: DOI
Hifi, Mhand; Sadfi, Slim; Sbihi, Abdelkader An efficient algorithm for the knapsack sharing problem. (English) Zbl 1064.90040 Comput. Optim. Appl. 23, No. 1, 27-45 (2002). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{M. Hifi} et al., Comput. Optim. Appl. 23, No. 1, 27--45 (2002; Zbl 1064.90040) Full Text: DOI
Hifi, Mhand; Roucairol, Catherine Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems. (English) Zbl 1135.90389 J. Comb. Optim. 5, No. 4, 465-494 (2001). MSC: 90C27 90C39 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{C. Roucairol}, J. Comb. Optim. 5, No. 4, 465--494 (2001; Zbl 1135.90389) Full Text: DOI
Hifi, Mhand Exact algorithms for large-scale unconstrained two and three staged cutting problems. (English) Zbl 0963.90051 Comput. Optim. Appl. 18, No. 1, 63-88 (2001). MSC: 90C27 90C39 PDFBibTeX XMLCite \textit{M. Hifi}, Comput. Optim. Appl. 18, No. 1, 63--88 (2001; Zbl 0963.90051) Full Text: DOI
Fayard, D.; Hifi, M.; Zissimopoulos, V. An efficient approach for large-scale two-dimensional guillotine cutting stock problems. (English) Zbl 1140.90374 J. Oper. Res. Soc. 49, No. 12, 1270-1277 (1998). MSC: 90B30 90C27 90C39 90C59 PDFBibTeX XMLCite \textit{D. Fayard} et al., J. Oper. Res. Soc. 49, No. 12, 1270--1277 (1998; Zbl 1140.90374) Full Text: DOI
Hifi, Mhand Exact algorithms for the guillotine strip cutting/packing problem. (English) Zbl 1040.90568 Comput. Oper. Res. 25, No. 11, 925-940 (1998). MSC: 90C57 90C27 90C39 90C59 PDFBibTeX XMLCite \textit{M. Hifi}, Comput. Oper. Res. 25, No. 11, 925--940 (1998; Zbl 1040.90568) Full Text: DOI
Hifi, Mhand The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems. (English) Zbl 0929.90073 Eur. J. Oper. Res. 97, No. 1, 41-52 (1997). MSC: 90C27 90C39 90C59 PDFBibTeX XMLCite \textit{M. Hifi}, Eur. J. Oper. Res. 97, No. 1, 41--52 (1997; Zbl 0929.90073) Full Text: DOI
Hifi, M.; Zissimopoulos, V. Constrained two-dimensional cutting: An improvement of Christofides and Whitlock’s exact algorithm. (English) Zbl 0890.90157 J. Oper. Res. Soc. 48, No. 3, 324-331 (1997). MSC: 90C27 90C39 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{V. Zissimopoulos}, J. Oper. Res. Soc. 48, No. 3, 324--331 (1997; Zbl 0890.90157) Full Text: DOI
Hifi, Mhand An improvement of Viswanathan and Bagchi’s exact algorithm for constrained two-dimensional cutting stock. (English) Zbl 0914.90225 Comput. Oper. Res. 24, No. 8, 727-736 (1997). MSC: 90C27 PDFBibTeX XMLCite \textit{M. Hifi}, Comput. Oper. Res. 24, No. 8, 727--736 (1997; Zbl 0914.90225) Full Text: DOI
Hifi, M. A genetic algorithm-based heuristic for solving the weighted maximum independent set and some equivalent problems. (English) Zbl 0882.90112 J. Oper. Res. Soc. 48, No. 6, 612-622 (1997). MSC: 90C27 68T05 PDFBibTeX XMLCite \textit{M. Hifi}, J. Oper. Res. Soc. 48, No. 6, 612--622 (1997; Zbl 0882.90112) Full Text: DOI
Hifi, Mhand; Zissimopoulos, Vassilis An improvement on the recursive algorithm of Herz for the two-dimensional cutting stock problem. (Une amélioration de l’algorithme récursif de Herz pour le problème de découpe à deux dimensions.) (French) Zbl 0859.90107 RAIRO, Rech. Opér. 30, No. 2, 111-125 (1996). MSC: 90C27 90C39 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{V. Zissimopoulos}, RAIRO, Rech. Opér. 30, No. 2, 111--125 (1996; Zbl 0859.90107) Full Text: DOI EuDML
Hifi, M.; Zissimopoulos, V. A recursive exact algorithm for weighted two-dimensional cutting. (English) Zbl 0924.90118 Eur. J. Oper. Res. 91, No. 3, 553-564 (1996). MSC: 90C27 90C39 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{V. Zissimopoulos}, Eur. J. Oper. Res. 91, No. 3, 553--564 (1996; Zbl 0924.90118) Full Text: DOI