Slim Sadfi

According to our database, Slim Sadfi authored at least 4 papers between 2002 and 2005.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2005

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

Mhand Hifi, Hedi M'Halla, Slim Sadfi

J. Comb. Optim., 2005

An exact algorithm for the knapsack sharing problem.

Mhand Hifi, Hedi M'Halla, Slim Sadfi

Comput. Oper. Res., 2005

2002

The Knapsack Sharing Problem: An Exact Algorithm.

Mhand Hifi, Slim Sadfi

J. Comb. Optim., 2002

An Efficient Algorithm for the Knapsack Sharing Problem.

Mhand Hifi, Slim Sadfi, Abdelkader Sbihi

Comput. Optim. Appl., 2002