 | 2009 |
|---|
| 19 |       | Hakim Akeb,
Mhand Hifi,
Rym M'Hallah:
A beam search algorithm for the circular packing problem.
Computers & OR 36(5): 1513-1528 (2009) |
| 2008 |
|---|
| 18 | | Tarik Belgacem,
Mhand Hifi:
Sensitivity analysis of the knapsack sharing problem: Perturbation of the weight of an item.
Computers & OR 35(1): 295-308 (2008) |
| 17 | | Tarik Belgacem,
Mhand Hifi:
Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem.
Discrete Optimization 5(4): 755-761 (2008) |
| 16 | | Mhand Hifi,
Rym M'Hallah,
Toufik Saadi:
Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem.
INFORMS Journal on Computing 20(2): 212-221 (2008) |
| 2007 |
|---|
| 15 | | Mhand Hifi,
M. Michrafy:
Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem.
Computers & OR 34(9): 2657-2673 (2007) |
| 14 | | Mhand Hifi,
Rym M'Hallah:
A dynamic adaptive local search algorithm for the circular packing problem.
European Journal of Operational Research 183(3): 1280-1294 (2007) |
| 2006 |
|---|
| 13 | | Mhand Hifi,
Rym M'Hallah:
Strip generation algorithms for constrained two-dimensional two-staged cutting problems.
European Journal of Operational Research 172(2): 515-527 (2006) |
| 2005 |
|---|
| 12 | | Mhand Hifi,
Hedi M'Halla,
Slim Sadfi:
An exact algorithm for the knapsack sharing problem.
Computers & OR 32: 1311-1324 (2005) |
| 11 | | Mhand Hifi,
Hedi M'Halla,
Slim Sadfi:
Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem.
J. Comb. Optim. 10(3): 239-260 (2005) |
| 10 | | Mhand Hifi,
Rym M'Hallah:
An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems.
Operations Research 53(1): 140-150 (2005) |
| 2004 |
|---|
| 9 | | Mhand Hifi:
Exact algorithms for unconstrained three-dimensional cutting problems: a comparative study.
Computers & OR 31(5): 657-674 (2004) |
| 8 | | Mhand Hifi,
Rym M'Hallah:
Approximate algorithms for constrained circular cutting problems.
Computers & OR 31(5): 675-694 (2004) |
| 7 | | Mhand Hifi,
Vangelis Th. Paschos,
Vassilis Zissimopoulos:
A simulated annealing approach for the circular cutting problem.
European Journal of Operational Research 159(2): 430-448 (2004) |
| 6 | | Mhand Hifi:
Dynamic Programming and Hill-Climbing Techniques for Constrained Two-Dimensional Cutting Stock Problems.
J. Comb. Optim. 8(1): 65-84 (2004) |
| 2002 |
|---|
| 5 |  | Mhand Hifi,
Slim Sadfi:
The Knapsack Sharing Problem: An Exact Algorithm.
J. Comb. Optim. 6(1): 35-54 (2002) |
| 4 | | Mhand Hifi,
Rym M'Hallah:
A Best-Local Position Procedure-Based Heuristic for Two-Dimensional Layout Problems.
Stud. Inform. Univ. 2(1): 33-56 (2002) |
| 2001 |
|---|
| 3 | | Mhand Hifi,
Catherine Roucairol:
Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems.
J. Comb. Optim. 5(4): 465-494 (2001) |
| 1998 |
|---|
| 2 | | Mhand Hifi:
Exact algorithms for the guillotine strip cutting/packing problem.
Computers & OR 25(11): 925-940 (1998) |
| 1997 |
|---|
| 1 | | Mhand Hifi:
An improvement of viswanathan and bagchi's exact algorithm for constrained two-dimensional cutting stock.
Computers & OR 24(8): 727-736 (1997) |
