Mhand Hifi - researchr alias

researchr

You are not signed in
Sign in
Sign up

2012

Special issue on knapsack problems and applicationsMhand Hifi, Rym M Hallah. cor, 39(1):1-2, 2012. [doi]

2011

Local branching-based algorithms for the disjunctively constrained knapsack problemHakim Akeb, Mhand Hifi, Mohamed Elhafedh Ould Ahmed Mounir. candie, 60(4):811-820, 2011. [doi]

High Performance Peer-to-Peer Distributed Computing with Application to Constrained Two-Dimensional Guillotine Cutting ProblemMhand Hifi, Toufik Saadi, Nawel Haddadou. pdp 2011: 552-559 [doi]

2010

A hybrid beam search looking-ahead algorithm for the circular packing problemHakim Akeb, Mhand Hifi. jco, 20(2):101-130, 2010. [doi]

A Linear Programming Approach for the Three-Dimensional Bin-Packing ProblemMhand Hifi, Imed Kacem, Stéphane Nègre, Lei Wu. endm, 36:993-1000, 2010. [doi]

Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case StudyMhand Hifi, Hedi M Halla. endm, 36:439-446, 2010. [doi]

2009

A beam search algorithm for the circular packing problemHakim Akeb, Mhand Hifi, Rym M Hallah. cor, 36(5):1513-1528, 2009. [doi]

A Literature Review on Circle and Sphere Packing Problems: Models and MethodologiesMhand Hifi, Rym M Hallah. advor, 2009, 2009. [doi]

2008

Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problemTarik Belgacem, Mhand Hifi. disopt, 5(4):755-761, 2008. [doi]

Sensitivity analysis of the knapsack sharing problem: Perturbation of the weight of an itemTarik Belgacem, Mhand Hifi. cor, 35(1):295-308, 2008. [doi]

Algorithms for the Constrained Two-Staged Two-Dimensional Cutting ProblemMhand Hifi, Rym M Hallah, Toufik Saadi. informs, 20(2):212-221, 2008. [doi]

2007

Reduction strategies and exact algorithms for the disjunctively constrained knapsack problemMhand Hifi, M. Michrafy. cor, 34(9):2657-2673, 2007. [doi]

A dynamic adaptive local search algorithm for the circular packing problemMhand Hifi, Rym M Hallah. eor, 183(3):1280-1294, 2007. [doi]

2006

Strip generation algorithms for constrained two-dimensional two-staged cutting problemsMhand Hifi, Rym M Hallah. eor, 172(2):515-527, 2006. [doi]

2005

An exact algorithm for the knapsack sharing problemMhand Hifi, Hedi M Halla, Slim Sadfi. cor, 32:1311-1324, 2005. [doi]

Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack ProblemMhand Hifi, Hedi M Halla, Slim Sadfi. jco, 10(3):239-260, 2005. [doi]

An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting ProblemsMhand Hifi, Rym M Hallah. ior, 53(1):140-150, 2005. [doi]

2004

Exact algorithms for unconstrained three-dimensional cutting problems: a comparative studyMhand Hifi. cor, 31(5):657-674, 2004. [doi]

Approximate algorithms for constrained circular cutting problemsMhand Hifi, Rym M Hallah. cor, 31(5):675-694, 2004. [doi]

Dynamic Programming and Hill-Climbing Techniques for Constrained Two-Dimensional Cutting Stock ProblemsMhand Hifi. jco, 8(1):65-84, 2004. [doi]

A simulated annealing approach for the circular cutting problemMhand Hifi, Vangelis Th. Paschos, Vassilis Zissimopoulos. eor, 159(2):430-448, 2004. [doi]

2002

The Knapsack Sharing Problem: An Exact AlgorithmMhand Hifi, Slim Sadfi. jco, 6(1):35-54, 2002.

A Best-Local Position Procedure-Based Heuristic for Two-Dimensional Layout ProblemsMhand Hifi, Rym M Hallah. siu, 2(1):33-56, 2002. [doi]

2001

Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock ProblemsMhand Hifi, Catherine Roucairol. jco, 5(4):465-494, 2001.

1998

Exact algorithms for the guillotine strip cutting/packing problemMhand Hifi. cor, 25(11):925-940, 1998. [doi]

1997

An improvement of viswanathan and bagchi s exact algorithm for constrained two-dimensional cutting stockMhand Hifi. cor, 24(8):727-736, 1997. [doi]