All Stories

  1. Lagrangian heuristic-based neighbourhood search for the multiple-choice multi-dimensional knapsack problem

    Article • Engineering Optimization, December 2014, Taylor & Francis

    Dr Mhand Hifi

  2. A Three-Stage Heuristic for the Capacitated Vehicle Routing Problem with Time Windows

    Article • December 2014, Springer Science + Business Media

    Dr Mhand Hifi

  3. Width Beam and Hill-Climbing Strategies for the Three-Dimensional Sphere Packing Problem

    Article • September 2014, Polish Information Processing Society PTI

    Dr Mhand Hifi

  4. A Parallel Large Neighborhood Search-Based Heuristic for the Disjunctively Constrained Knapsack Problem

    Article • May 2014, Institute of Electrical & Electronics Engineers (IEEE)

    Dr Mhand Hifi

  5. A Fast Large Neighborhood Search for Disjunctively Constrained Knapsack Problems

    Article • January 2014, Springer Science + Business Media

    Dr Mhand Hifi

  6. New upper bounds and exact methods for the knapsack sharing problem

    Article • Applied Mathematics and Computation, January 2014, Elsevier

    Dr Mhand Hifi

  7. Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem

    Article • International Transactions in Operational Research, December 2013, Wiley

    Dr Mhand Hifi

  8. Sensitivity analysis to perturbations of the weight of a subset of items: The knapsack case study

    Article • Discrete Optimization, November 2013, Elsevier

    Dr Mhand Hifi

  9. An iterative rounding search-based algorithm for the disjunctively constrained knapsack problem

    Article • Engineering Optimization, September 2013, Taylor & Francis

    Dr Mhand Hifi

  10. Solving the circular open dimension problem by using separate beams and look-ahead strategies

    Article • Computers & Operations Research, May 2013, Elsevier

    Dr Mhand Hifi

  11. A Heuristic Based Algorithm for the 2D Circular Strip Packing Problem

    Article • January 2013, Springer Science + Business Media

    Dr Mhand Hifi

  12. An Approximation Algorithm for the Three Depots Hamiltonian Path Problem

    Article • September 2012, Springer Science + Business Media

    Dr Mhand Hifi

  13. A parallel algorithm for constrained two-staged two-dimensional cutting problems

    Article • Computers & Industrial Engineering, February 2012, Elsevier

    Dr Mhand Hifi

  14. Special issue on knapsack problems and applications

    Article • Computers & Operations Research, January 2012, Elsevier

    Dr Mhand Hifi

  15. Packing circles in the smallest circle: an adaptive hybrid algorithm

    Article • Journal of the Operational Research Society, November 2011, Taylor & Francis

    Dr Mhand Hifi

  16. An augmented beam search-based algorithm for the circular open dimension problem

    Article • Computers & Industrial Engineering, September 2011, Elsevier

    Dr Mhand Hifi

  17. Local branching-based algorithms for the disjunctively constrained knapsack problem

    Article • Computers & Industrial Engineering, May 2011, Elsevier

    Dr Mhand Hifi

  18. A first level scatter search for disjunctively constrained knapsack problems

    Article • March 2011, Institute of Electrical & Electronics Engineers (IEEE)

    Dr Mhand Hifi

  19. High Performance Peer-to-Peer Distributed Computing with Application to Constrained Two-Dimensional Guillotine Cutting Problem

    Article • February 2011, Institute of Electrical & Electronics Engineers (IEEE)

    Dr Mhand Hifi

  20. A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems

    Article • Computational Optimization and Applications, September 2010, Springer Science + Business Media

    Dr Mhand Hifi

  21. Adaptive beam search lookahead algorithms for the circular packing problem

    Article • International Transactions in Operational Research, August 2010, Wiley

    Dr Mhand Hifi

  22. A Linear Programming Approach for the Three-Dimensional Bin-Packing Problem

    Article • Electronic Notes in Discrete Mathematics, August 2010, Elsevier

    Dr Mhand Hifi

  23. Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study

    Article • Electronic Notes in Discrete Mathematics, August 2010, Elsevier

    Dr Mhand Hifi

  24. A cooperative algorithm for constrained two-staged two-dimensional cutting problems

    Article • International Journal of Operational Research, January 2010, Inderscience Publishers

    Dr Mhand Hifi

  25. Heuristics Algorithms Based on a Linear Programming for the Three-Dimensional Bin-Packing Problem

    Article • IFAC Proceedings Volumes, January 2010, Elsevier

    Dr Mhand Hifi

  26. A non-oscillating beam-search with a look-ahead for the circular packing problem

    Article • December 2009, Institute of Electrical & Electronics Engineers (IEEE)

    Dr Mhand Hifi

  27. Makespan minimization on two parallel machines with release dates

    Article • July 2009, Institute of Electrical & Electronics Engineers (IEEE)

    Dr Mhand Hifi

  28. An augmented beam search-based algorithm for the circular open dimension problem

    Article • July 2009, Institute of Electrical & Electronics Engineers (IEEE)

    Dr Mhand Hifi

  29. Local branching-based algorithm for the disjunctively constrained knapsack problem

    Article • July 2009, Institute of Electrical & Electronics Engineers (IEEE)

    Dr Mhand Hifi

  30. A parallel algorithm for constrained fixed two-staged two-dimensional cutting/packing problems

    Article • July 2009, Institute of Electrical & Electronics Engineers (IEEE)

    Dr Mhand Hifi

  31. A beam search algorithm for the circular packing problem

    Article • Computers & Operations Research, May 2009, Elsevier

    Dr Mhand Hifi

  32. Adaptive algorithms for Circular Cutting/packing problems

    Article • International Journal of Operational Research, January 2009, Inderscience Publishers

    Dr Mhand Hifi

  33. Hybrid algorithms for the Multiple-choice Multi-dimensional Knapsack Problem

    Article • International Journal of Operational Research, January 2009, Inderscience Publishers

    Dr Mhand Hifi

  34. Beam search and non-linear programming tools for the circular packing problem

    Article • International Journal of Mathematics in Operational Research, January 2009, Inderscience Publishers

    Dr Mhand Hifi

  35. A Literature Review on Circle and Sphere Packing Problems: Models and Methodologies

    Article • Advances in Operations Research, January 2009, Hindawi Publishing Corporation

    Dr Mhand Hifi

  36. Sensitivity analysis of the knapsack problem: tighter lower and upper bound limits

    Article • Journal of Systems Science and Systems Engineering, December 2008, Springer Science + Business Media

    Dr Mhand Hifi

  37. Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem

    Article • Discrete Optimization, November 2008, Elsevier

    Dr Mhand Hifi

  38. Algorithms for the circular two‐dimensional open dimension problem

    Article • International Transactions in Operational Research, October 2008, Wiley

    Dr Mhand Hifi

  39. A hybrid beam search looking-ahead algorithm for the circular packing problem

    Article • Journal of Combinatorial Optimization, October 2008, Springer Science + Business Media

    Dr Mhand Hifi

  40. Sensitivity analysis of the knapsack problem: Tighter lower and upper bound limits

    Article • Journal of Systems Science and Systems Engineering, June 2008, Springer Science + Business Media

    Dr Mhand Hifi

  41. A column generation method for the multiple-choice multi-dimensional knapsack problem

    Article • Computational Optimization and Applications, May 2008, Springer Science + Business Media

    Dr Mhand Hifi

  42. Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem

    Article • INFORMS Journal on Computing, May 2008, INFORMS

    Dr Mhand Hifi

  43. An adaptive algorithm for the knapsack problem: perturbation of the profit or weight of an arbitrary item

    Article • European J of Industrial Engineering, January 2008, Inderscience Publishers

    Dr Mhand Hifi

  44. A Hybrid Credit Scoring Model Based on Genetic Programming and Support Vector Machines

    Article • January 2008, Institute of Electrical & Electronics Engineers (IEEE)

    Dr Mhand Hifi

  45. Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item

    Article • International Transactions in Operational Research, January 2008, Wiley

    Dr Mhand Hifi

  46. Sensitivity analysis of the knapsack sharing problem: Perturbation of the weight of an item

    Article • Computers & Operations Research, January 2008, Elsevier

    Dr Mhand Hifi

  47. A dynamic adaptive local search algorithm for the circular packing problem

    Article • European Journal of Operational Research, December 2007, Elsevier

    Dr Mhand Hifi

  48. Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem

    Article • Computational Optimization and Applications, October 2007, Springer Science + Business Media

    Dr Mhand Hifi

  49. Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem

    Article • Computers & Operations Research, September 2007, Elsevier

    Dr Mhand Hifi

  50. Adaptive and restarting techniques-based algorithms for circular packing problems

    Article • Computational Optimization and Applications, June 2007, Springer Science + Business Media

    Dr Mhand Hifi

  51. Sensitivity analysis of the knapsack problem: an improved result

    Article • October 2006, Institute of Electrical & Electronics Engineers (IEEE)

    Dr Mhand Hifi

  52. A Cooperative Algorithm for Constrained Two-staged 2D Cutting Problems

    Article • October 2006, Institute of Electrical & Electronics Engineers (IEEE)

    Dr Mhand Hifi

  53. Strip generation algorithms for constrained two-dimensional two-staged cutting problems

    Article • European Journal of Operational Research, July 2006, Elsevier

    Dr Mhand Hifi

  54. A reactive local search-based algorithm for the disjunctively constrained knapsack problem

    Article • Journal of the Operational Research Society, June 2006, Taylor & Francis

    Dr Mhand Hifi

  55. Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem

    Article • Journal of Combinatorial Optimization, November 2005, Springer Science + Business Media

    Dr Mhand Hifi

  56. A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem

    Article • Computational Optimization and Applications, October 2005, Springer Science + Business Media

    Dr Mhand Hifi

  57. An exact algorithm for the knapsack sharing problem

    Article • Computers & Operations Research, May 2005, Elsevier

    Dr Mhand Hifi

  58. An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems

    Article • Operations Research, February 2005, INFORMS

    Dr Mhand Hifi

  59. A simulated annealing approach for the circular cutting problem

    Article • European Journal of Operational Research, December 2004, Elsevier

    Dr Mhand Hifi

  60. Heuristic algorithms for the multiple-choice multidimensional knapsack problem

    Article • Journal of the Operational Research Society, December 2004, Taylor & Francis

    Dr Mhand Hifi

  61. Exact algorithms for unconstrained three-dimensional cutting problems: a comparative study

    Article • Computers & Operations Research, April 2004, Elsevier

    Dr Mhand Hifi

  62. Approximate algorithms for constrained circular cutting problems

    Article • Computers & Operations Research, April 2004, Elsevier

    Dr Mhand Hifi

  63. Dynamic Programming and Hill-Climbing Techniques for Constrained Two-Dimensional Cutting Stock Problems

    Article • Journal of Combinatorial Optimization, March 2004, Springer Science + Business Media

    Dr Mhand Hifi

  64. A hybrid algorithm for the two‐dimensional layout problem: the cases of regular and irregular shapes

    Article • International Transactions in Operational Research, May 2003, Wiley

    Dr Mhand Hifi

  65. Approximate algorithms for the container loading problem

    Article • International Transactions in Operational Research, November 2002, Wiley

    Dr Mhand Hifi

  66. A neural network for the minimum set covering problem

    Article • Chaos Solitons & Fractals, October 2000, Elsevier

    Dr Mhand Hifi

  67. Constrained two‐dimensional cutting stock problems a best‐first branch‐and‐bound algorithm

    Article • International Transactions in Operational Research, May 2000, Wiley

    Dr Mhand Hifi

  68. An Efficient Approach for Large-Scale Two-Dimensional Guillotine Cutting Stock Problems

    Article • Journal of the Operational Research Society, December 1998, JSTOR

    Dr Mhand Hifi

  69. An efficient approach for large-scale two-dimensional guillotine cutting stock problems

    Article • Journal of the Operational Research Society, December 1998, Taylor & Francis

    Dr Mhand Hifi

  70. Exact algorithms for the guillotine strip cutting/packing problem

    Article • Computers & Operations Research, November 1998, Elsevier

    Dr Mhand Hifi

  71. A Best‐first Branch‐and‐bound Algorithm for Orthogonal Rectangular Packing Problems

    Article • International Transactions in Operational Research, September 1998, Wiley

    Dr Mhand Hifi

  72. A best-first branch-and-bound algorithm for orthogonal rectangular packing problems

    Article • International Transactions in Operational Research, September 1998, Wiley

    Dr Mhand Hifi

  73. An efficient approach for large-scale two-dimensional guillotine cutting stock problems

    Article • Journal of the Operational Research Society, January 1998, Springer Science + Business Media

    Dr Mhand Hifi

  74. An improvement of viswanathan and bagchi's exact algorithm for constrained two-dimensional cutting stock

    Article • Computers & Operations Research, August 1997, Elsevier

    Dr Mhand Hifi

  75. A Genetic Algorithm-Based Heuristic for Solving the Weighted Maximum Independent Set and Some Equivalent Problems

    Article • Journal of the Operational Research Society, June 1997, JSTOR

    Dr Mhand Hifi

  76. A genetic algorithm-based heuristic for solving the weighted maximum independent set and some equivalent problems

    Article • Journal of the Operational Research Society, June 1997, Taylor & Francis

    Dr Mhand Hifi

  77. Constrained Two-Dimensional Cutting: An Improvement of Christofides and Whitlock's Exact Algorithm

    Article • Journal of the Operational Research Society, March 1997, JSTOR

    Dr Mhand Hifi

  78. Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm

    Article • Journal of the Operational Research Society, March 1997, Taylor & Francis

    Dr Mhand Hifi

  79. The DH/KD algorithm: a hybrid approach for unconstrained two-dimensional cutting problems

    Article • European Journal of Operational Research, February 1997, Elsevier

    Dr Mhand Hifi

  80. Best-first search and dynamic programming methods for cutting problems: The cases of one or more stock plates

    Article • Computers & Industrial Engineering, January 1997, Elsevier

    Dr Mhand Hifi

  81. Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm

    Article • Journal of the Operational Research Society, January 1997, Springer Science + Business Media

    Dr Mhand Hifi

  82. A genetic algorithm-based heuristic for solving the weighted maximum independent set and some equivalent problems

    Article • Journal of the Operational Research Society, January 1997, Springer Science + Business Media

    Dr Mhand Hifi

  83. A recursive exact algorithm for weighted two-dimensional cutting

    Article • European Journal of Operational Research, June 1996, Elsevier

    Dr Mhand Hifi

  84. A New Efficient Heuristic for the Minimum Set Covering Problem

    Article • Journal of the Operational Research Society, October 1995, JSTOR

    Dr Mhand Hifi

  85. A New Efficient Heuristic For the Minimum Set Covering Problem

    Article • Journal of the Operational Research Society, October 1995, Springer Science + Business Media

    Dr Mhand Hifi

  86. A New Efficient Heuristic for the Minimum Set Covering Problem

    Article • Journal of the Operational Research Society, October 1995, Taylor & Francis

    Dr Mhand Hifi