A modified algorithm for the strict feasibility problem. - Djamel Benterki; Bachir Merikhi (RAIRO Oper. Res., 2001)

A numerical feasible interior point method for linear semidefinite programs. - Djamel Benterki; Jean-Pierre Crouzeix; Bachir Merikhi (RAIRO Oper. Res., 2007)

An improving procedure of the interior projective method for linear programming. - Djamel Benterki; A. Leulmi (Appl. Math. Comput., 2008)

Finding a strict feasible solution of a linear semidefinite program. - Djamel Benterki; Abdelkrim Keraghel (Appl. Math. Comput., 2011)

A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function. - Mousaab Bouafia; Djamel Benterki; Adnan Yassine (MCO (1), 2015)

New effective projection method for variational inequalities problem. - Hassina Grar; Djamel Benterki (RAIRO Oper. Res., 2015)

A relaxed logarithmic barrier method for semidefinite programming. - Kettab Samia; Djamel Benterki (RAIRO Oper. Res., 2015)

An Efficient Primal-Dual Interior Point Method for Linear Programming Problems Based on a New Kernel Function with a Trigonometric Barrier Term. - Mousaab Bouafia; Djamel Benterki; Adnan Yassine (J. Optim. Theory Appl., 2016)

Complexity analysis of interior point methods for linear programming based on a parameterized kernel function. - Mousaab Bouafia; Djamel Benterki; Adnan Yassine (RAIRO Oper. Res., 2016)

A logarithmic barrier approach for linear programming. - Linda Menniche; Djamel Benterki (J. Comput. Appl. Math., 2017)

A feasible primal-dual interior point method for linear semidefinite programming. - Imene Touil; Djamel Benterki; Adnan Yassine (J. Comput. Appl. Math., 2017)

An efficient parameterized logarithmic kernel function for linear optimization. - Mousaab Bouafia; Djamel Benterki; Adnan Yassine (Optim. Lett., 2018)

A new efficient short-step projective interior point method for linear programming. - Mousaab Bouafia; Djamel Benterki; Adnan Yassine (Oper. Res. Lett., 2018)

Adaptive projection methods for linear fractional programming. - Ahlem Bennani; Djamel Benterki; Hassina Grar (RAIRO Oper. Res., 2021)

Efficient projective algorithm for linear fractional programming problem based on a linear programming formulation. - Ahlem Bennani; Djamel Benterki (Int. J. Comput. Sci. Math., 2022)

Optimal control of an epidemic by vaccination using dynamic programming approach. - Touffik Bouremani; Djamel Benterki; Yacine Slimani (Int. J. Math. Oper. Res., 2022)

Interior-point algorithm for linear programming based on a new descent direction. - Zaoui Billel; Djamel Benterki; Aicha Kraria; Raouache Hadjer (RAIRO Oper. Res., 2023)

Primal-dual interior-point algorithm for linearly constrained convex optimization based on a parametric algebraic transformation. - Aicha Kraria; Bachir Merikhi; Djamel Benterki (CoRR, 2024)

On Isaac's War Game of Attrition and Attack Using Dynamic Programming Approach. - Safa Benghebrid; Touffik Bouremani; Djamel Benterki (Games, 2024)

New hybrid conjugate gradient method for nonlinear optimization with application to image restoration problems. - Youcef Elhamam Hemici; Samia Khelladi; Djamel Benterki (Kybernetika, 2024)

Complexity analysis and numerical implementation of a new interior-point algorithm for semidefinite optimization. - Zaoui Billel; Djamel Benterki; Samia Khelladi (Oper. Res. Lett., 2024)

An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization. - Zaoui Billel; Djamel Benterki; Adnan Yassine (J. Appl. Math. Comput., 2024)

On the solution of Dolichobrachistochrone differential game via dynamic programming approach. - Aicha Ghanem; Touffik Bouremani; Djamel Benterki (J. Comput. Appl. Math., 2025)