Search

Your search keyword '"Hifi, Mhand"' showing total 310 results
Start Over Author "Hifi, Mhand"
310 results on '"Hifi, Mhand"'

1. A Cooperative Machine Learning-Based Algorithm: The Case of Max-Min Knapsack Problem with Multiple Scenarios

Author

Zhao, Juntao, Hifi, Mhand, Zhang, Yulin, Luo, Xiaochuan, Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, Abraham, Ajith, editor, Bajaj, Anu, editor, Hanne, Thomas, editor, Siarry, Patrick, editor, and Ma, Kun, editor

Published
2024
Full Text
View/download PDF

2. A Hybrid Machine Learning Method for Solving the Set Union Knapsack Problem

Author

Zhao, Juntao, Hifi, Mhand, Saadi, Toufik, Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, Abraham, Ajith, editor, Bajaj, Anu, editor, and Hanne, Thomas, editor

Published
2024
Full Text
View/download PDF

14. An Iterative Randomized Rounding Algorithm for the k-Clustering Minimum Completion Problem with an Application in Telecommunication Field

Author

Hifi, Mhand, Sadeghsa, Shohre, Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, and Arai, Kohei, editor

Published
2022
Full Text
View/download PDF

17. Data Delivery by Mobile Agents with Energy Constraints over a fixed path

Author

Giannakos, Aristotelis, Hifi, Mhand, and Karagiorgos, Gregory

Subjects
Computer Science - Data Structures and Algorithms
Abstract

We consider $k$ mobile agents of limited energy that are initially located at vertices of an edge-weighted graph $G$ and have to collectively deliver data from a source vertex $s$ to a target vertex $t$. The data are to be collected by an agent reaching $s$, who can carry and then hand them over another agent etc., until some agent with the data reaches $t$. The data can be carried only over a fixed $s-t$ path of $G$; each agent has an initial energy budget and each time it passes an edge, it consumes the edge's weights in energy units and stalls if its energy is not anymore sufficient to move. The main result of this paper is a 3-approximation polynomial time algorithm for the data delivery problem over a fixed $s-t$ path in the graph, for identical initial energy budgets and at most one allowed data hand-over per agent.

Published
2017

36. Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups.

Author

Boukhari, Samah and Hifi, Mhand

Subjects
KNAPSACK problems, INTEGER programming, LEARNING strategies
Abstract

In this paper, the multiple‐choice knapsack problem with setups is tackled with an iterative method, where both local branching and descent method cooperate. First, an iterative procedure is designed for solving a series of mixed integer programming problems combined with a special reduced subproblem; that is, a combined model built by injecting some valid cardinality constraints. Second, the local branching‐based learning strategy is embedded into an iterative search to mimic the variable neighborhood descent method, such that the local branching strategy drives the search process for enhancing the quality of the solutions. Third, the proposed method is experimentally analyzed on benchmark instances extracted from the literature, where its provided (lower) bounds are compared to those reached by methods published in the literature and the Cplex solver. Finally, its performance is evaluated by providing a statistical analysis. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

41. A Fast Large Neighborhood Search for Disjunctively Constrained Knapsack Problems

Author

Hifi, Mhand, Saleh, Sagvan, Wu, Lei, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, 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, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Fouilhoux, Pierre, editor, Gouveia, Luis Eduardo Neves, editor, Mahjoub, A. Ridha, editor, and Paschos, Vangelis T., editor

Published
2014
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results