Search

Your search keyword '"Yassine, Adnan"' showing total 188 results
Start Over Author "Yassine, Adnan"
188 results on '"Yassine, Adnan"'

2. Solving an Integrated Bi-objective Container Terminal Integrated Planning with Transshipment Operations

Author

Samrout, Marwa, Sbihi, Abdelkader, Yassine, Adnan, Hartmanis, Juris, Founding Editor, van Leeuwen, Jan, Series Editor, Hutchison, David, Editorial Board Member, Kanade, Takeo, Editorial Board Member, Kittler, Josef, Editorial Board Member, Kleinberg, Jon M., Editorial Board Member, Kobsa, Alfred, Series Editor, Mattern, Friedemann, Editorial Board Member, Mitchell, John C., Editorial Board Member, Naor, Moni, Editorial Board Member, Nierstrasz, Oscar, Series Editor, Pandu Rangan, C., Editorial Board Member, Sudan, Madhu, Series Editor, Terzopoulos, Demetri, Editorial Board Member, Tygar, Doug, Editorial Board Member, Weikum, Gerhard, Series Editor, Vardi, Moshe Y, Series Editor, Goos, Gerhard, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Sevaux, Marc, editor, Olteanu, Alexandru-Liviu, editor, Pardo, Eduardo G., editor, Sifaleras, Angelo, editor, and Makboul, Salma, editor

Published
2024
Full Text
View/download PDF

8. A Newton descent logarithmic barrier interior-point algorithm for monotone LCP

Author

Grimes, Welid, Achache, Mohamed, Yassine, Adnan, Grimes, Welid, Achache, Mohamed, and Yassine, Adnan

Abstract

The growing importance of the monotone linear complementarity problems (LCP) lies in the different applications it covers, both in mathematics and in practice. In this paper, based on the optimization techniques, we propose a descent logarithmic barrier interior-point method for solving the (LCP). The idea is to transform the LCP into an equivalent convex quadratic optimization problem, denoted by (CQO). Then, the associated barrier problem to CQO is formulated. The existence and the uniqueness of optimal solution of the barrier problem is showed. For its numerical aspects, the descent direction is computed by using the classical Newton’s method. However, to determine the displacement step along this direction, guaranteeing the maintenance of the new iterates inside the domain during the algorithm process and the improvement of the value of the objective function, we apply a new approach using approximation functions known as “minorant and majorant approximating functions”. The numerical results obtained are very promising and show the effectiveness of this new strategy.

Published
2024
Full Text
View/download PDF

11. An Efficient Algorithm Based Tabu Search for the Robust Sparse CARP Under Travel Costs Uncertainty

Author

Tfaili, Sara, Sbihi, Abdelkader, Yassine, Adnan, Diarrassouba, Ibrahima, Barbosa, Simone Diniz Junqueira, Editorial Board Member, Filipe, Joaquim, Editorial Board Member, Ghosh, Ashish, Editorial Board Member, Kotenko, Igor, Editorial Board Member, Washio, Takashi, Editorial Board Member, Yuan, Junsong, Editorial Board Member, Zhou, Lizhu, Editorial Board Member, Parlier, Greg H., editor, Liberatore, Federico, editor, and Demange, Marc, editor

Published
2019
Full Text
View/download PDF

13. Brain Tumor Segmentation Based on α‐Expansion Graph Cut.

Author

Soloh, Roaa, Alabboud, Hassan, Shahin, Ahmad, Yassine, Adnan, and El Chakik, Abdallah

Subjects
MAGNETIC resonance imaging, IMAGE processing, CANCER diagnosis, COMPUTER-assisted image analysis (Medicine), COMPUTER vision
Abstract

In recent years, there has been an increased interest in using image processing, computer vision, and machine learning in biological and medical imaging research. One area of this interest is the diagnosis of brain tumors, which is considered a difficult and time‐consuming task traditionally performed manually. In this study, we present a method for tumor detection from magnetic resonance images (MRI) using a well‐known graph‐based algorithm, the Boykov–Kolmogorov algorithm, and the α‐expansion method. This approach involves pre‐processing the MRIs, representing the image positions as nodes, and calculations of the weights between edges as differences in intensity. The problem is formulated as an energy minimization problem and is solved by finding the 0,1 score for the image. Post‐processing is also performed to enhance the overall segmentation. The proposed method is easy to implement and shows high accuracy, precision, and efficiency in the results. We believe that this approach will bring significant benefits to scientists and healthcare researchers in qualitative research and can be applied to various imaging modalities for future research. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

21. Complexity analysis of primal-dual interior-point methods for linear optimization based on a new efficient Bi-parameterized kernel function with a trigonometric barrier term

Author

Bouafia Mousaab and Yassine Adnan

Subjects
Management Science and Operations Research, Computer Science Applications, Theoretical Computer Science
Abstract

In this paper we are generalizing the efficient kernel function with trigonometric barrier term given by (M. Bouafia, D. Benterki and A. Yassine, J. Optim. Theory Appl. 170 (2016) 528–545). Using an elegant and simple analysis and under some easy to check conditions, we explore the best complexity result for the large update primal-dual interior point methods for linear optimization. This complexity estimate improves results obtained in (X. Li and M. Zhang, Oper. Res. Lett. 43 (2015) 471–475; M.R. Peyghami and S.F. Hafshejani, Numer. Algo. 67 (2014) 33–48; M. Bouafia, D. Benterki and A. Yassine, J. Optim. Theory Appl. 170 (2016) 528–545). Our comparative numerical experiments on some test problems consolidate and confirm our theoretical results according to which the new kernel function has promising applications compared to the kernel function given by (M. Bouafia and A. Yassine, Optim. Eng. 21 (2020) 651–672). Moreover, the comparative numerical study that we have established favors our new kernel function better than other best trigonometric kernel functions (M. Bouafia, D. Benterki and A. Yassine, J. Optim. Theory Appl. 170 (2016) 528–545; M. Bouafia and A. Yassine, Optim. Eng. 21 (2020) 651–672).

Published
2022
Full Text
View/download PDF

24. A Linear Integer Program to Reduce Air Traffic Delay in Enroute Airspace

Author

Farah, Ihsen, Yassine, Adnan, Galinho, Thierry, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Selamat, Ali, editor, Nguyen, Ngoc Thanh, editor, and Haron, Habibollah, editor

Published
2013
Full Text
View/download PDF

25. Hybrid Genetic Simulated Annealing Algorithm (HGSAA) to Solve Storage Container Problem in Port

Author

Moussi, Riadh, Ndiaye, Ndèye Fatma, Yassine, Adnan, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Pan, Jeng-Shyang, editor, Chen, Shyi-Ming, editor, and Nguyen, Ngoc Thanh, editor

Published
2012
Full Text
View/download PDF

29. COMPLEXITY OF PRIMAL-DUAL INTERIOR-POINT ALGORITHM FOR LINEAR PROGRAMMING BASED ON A NEW CLASS OF KERNEL FUNCTIONS.

Author

GUERDOUH, SAFA, CHIKOUCHE, WIDED, TOUIL, IMENE, and YASSINE, ADNAN

Subjects
LINEAR programming, KERNEL functions, INTERIOR-point methods, ALGORITHMS
Abstract

In this paper, we first present a polynomial-time primal-dual interior-point method (IPM) for solving linear programming (LP) problems, based on a new kernel function (KF) with a hyperbolic-logarithmic barrier term. To improve the iteration bound, we propose a parameterized version of this function. We show that the complexity result meets the currently best iteration bound for large-update methods by choosing a special value of the parameter. Numerical experiments reveal that the new KFs have better results comparing with the existing KFs including log t in their barrier term. To the best of our knowledge, this is the first IPM based on a parameterized hyperbolic-logarithmic KF. Moreover, it contains the first hyperbolic-logarithmic KF (Touil and Chikouche in Filomat 34:3957-3969, 2020) as a special case up to a multiplicative constant, and improves significantly both its theoretical and practical results. [ABSTRACT FROM AUTHOR]

Published
2023
Full Text
View/download PDF

50. Open Capacitated ARC routing problem by Hybridized Ant Colony Algorithm.

Author

Kanso, Bilal, Kansou, Ali, and Yassine, Adnan

Subjects
ANT algorithms, NP-hard problems, COMBINATORIAL optimization, ELECTRIC meters, SEARCH algorithms
Abstract

The Open Capacitated Arc Routing Problem OCARP is a well-known NP-hard real-world combinatorial optimization problem. It consists of determining optimal routes for vehicles in a given service area at a minimal cost distance. The main real application for OCARP is the Meter Reader Routing Problem (MRRP). In MRRP problem, each worker in the electric (or gas) company must visit and read the electric (or gas) meters to a set of customers by starting his route from the first customer on his visit list and finishing with the last one. The worker leaves where he wants once all the associated customers have been visited. In this paper, a metaheuristic called an Hybridized Ant Colony Algorithm (HACA) is developed and hybridized with a local search algorithm that involves the 2-opt, Swap, Relocate and Cross-exchange moves to solve OCARP problem. Computational results conducted on five different sets of OCARP-instances showed that our proposed algorithm HACA has reached good and competitive results on benchmark instances for the problem. [ABSTRACT FROM AUTHOR]

Published
2021
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results