| An efficient primal–dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term M Bouafia, D Benterki, A Yassine Journal of Optimization Theory and Applications 170, 528-545, 2016 | 56 | 2016 |
| A feasible primal–dual interior point method for linear semidefinite programming I Touil, D Benterki, A Yassine Journal of Computational and Applied Mathematics 312, 216-230, 2017 | 33 | 2017 |
| An efficient parameterized logarithmic kernel function for linear optimization M Bouafia, D Benterki, A Yassine Optimization Letters 12, 1079-1097, 2018 | 27 | 2018 |
| A numerical feasible interior point method for linear semidefinite programs D Benterki, JP Crouzeix, B Merikhi RAIRO-Operations Research-Recherche Opérationnelle 41 (1), 49-59, 2007 | 23 | 2007 |
| A logarithmic barrier approach for linear programming L Menniche, D Benterki Journal of computational and Applied Mathematics 312, 267-275, 2017 | 22 | 2017 |
| Complexity analysis of interior point methods for linear programming based on a parameterized kernel function M Bouafia, D Benterki, A Yassine RAIRO-Operations Research 50 (4-5), 935-949, 2016 | 18 | 2016 |
| Elaboration and implantation of an algorithm solving a capacitated four-index transportation problem R Zitouni, A Keraghel, D Benterki Applied Mathematical Sciences 1 (53), 2643-2657, 2007 | 18 | 2007 |
| A numerical implementation of an interior point method for semidefinite programming D Benterki, JP Crouzeix, B Merikhi Pesquisa Operacional 23, 49-59, 2003 | 18 | 2003 |
| A relaxed logarithmic barrier method for semidefinite programming K Samia, B Djamel RAIRO-Operations Research 49 (3), 555-568, 2015 | 15 | 2015 |
| Study of a logarithmic barrier approach for linear semidefinite programming A Leulmi, B Merikhi, D Benterki Сибирский федеральный университет. Siberian Federal University, 2018 | 12 | 2018 |
| Résolution des problemes de programmation semidéfinie par des méthodes de réduction du potentiel D Benterki These de doctorat, Département de mathématique, Université Ferhat Abbas, Sétif, 2004 | 12 | 2004 |
| Sur les performances de l’algorithme de Karmarkar pour la programmation linéaire A Keraghel, D Benterki Revue Roumaine des Sciences Techniques-Mécanique Appliquées 46 (1), 87-96, 2001 | 12 | 2001 |
| A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function N Boudjellal, H Roumili, DJ Benterki Optimization 70 (8), 1703-1724, 2021 | 11 | 2021 |
| A modified algorithm for the strict feasibility problem D Benterki, B Merikhi RAIRO-Operations Research 35 (4), 395-399, 2001 | 9 | 2001 |
| A primal-dual interior-point method for the semidefinite programming problem based on a new kernel function I Touil, D Benterki Nonlinear Funct. Anal 25, 2019 | 8 | 2019 |
| A new efficient short-step projective interior point method for linear programming M Bouafia, D Benterki, A Yassine Operations Research Letters 46 (3), 291-294, 2018 | 8 | 2018 |
| Complexity analysis of interior point methods for convex quadratic programming based on a parameterized kernel function N Boudjellal, H Roumili, D Benterki Bol. Soc. Parana. Mat. 40, 1-16, 2022 | 7 | 2022 |
| A weighted path-following method for linearly constrained convex programming Z Kebbiche, D Benterki Revue Roumaine de Mathématique Pures et Appliquées 57 (3), 245-256, 2012 | 7 | 2012 |
| Adaptive projection methods for linear fractional programming A Bennani, D Benterki, H Grar RAIRO-Operations Research 55, S2383-S2392, 2021 | 6 | 2021 |
| Improving complexity of Karmarkar's approach for linear programming D Benterki, M Bouafia Revue d'analyse numérique et de théorie de l'approximation 43 (2), 159-167, 2014 | 5 | 2014 |
mousaab bouafiaPHD of Mathematics, université 08 mai 1945 guelma在 univ-guelma.dz 的电子邮件经过验证
mousaab bouafiaPHD of Mathematics, université 08 mai 1945 guelma在 univ-guelma.dz 的电子邮件经过验证