( en | de | ru )

 

Disambiguation of "Saadi, Toufik"

Author of the publication

copydeleteadd this publication to your clipboard
ALMA, A Logistic Mobile Application Based on Internet of Things.

, , , and . GreenCom/iThings/CPScom, page 355-358. IEEE, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Saadi Hayali

Toufik Bennouas

Nidal al- Saadi

Fakhri al- Saadi

Toufik Tetah

 

Other publications of authors with the same name

A Cooperative Swarm Optimization-Based Algorithm for the Quadratic Multiple Knapsack Problem., , , and . CoDIT, page 1168-1173. IEEE, (2020)A Two-Stage Resolution Search-Based Heuristic for the Team Orienteering Problem., , and . FiCloud, page 442-447. IEEE Computer Society, (2014)High Performance Peer-to-Peer Distributed Computing with Application to Constrained Two-Dimensional Guillotine Cutting Problem., , and . PDP, page 552-559. IEEE Computer Society, (2011)A Parallel Large Neighborhood Search-Based Heuristic for the Disjunctively Constrained Knapsack Problem., , , , and . IPDPS Workshops, page 1547-1551. IEEE Computer Society, (2014)Résolution séquentielles et parallèles des problèmes de découpe / placement. (Exact, approximate and parallel algorithms for the Two-Dimensional Cutting stock Problem).. Pantheon-Sorbonne University, Paris, France, (2008)A reactive search for the quadratic knapsack problem., , and . CoDIT, page 495-499. IEEE, (2017)ALMA, A Logistic Mobile Application Based on Internet of Things., , , and . GreenCom/iThings/CPScom, page 355-358. IEEE, (2013)An Adaptive Neighborhood Search for k-Clustering Minimum Bi-clique Completion Problems., , , and . MCO (1), volume 359 of Advances in Intelligent Systems and Computing, page 15-25. Springer, (2015)Peer-to-Peer Solution of 2D Cutting Stocks Problems., , and . CTW, page 116-120. (2012)Neighborhood search-based heuristic for the k-clustering minimum biclique completion problem., , and . CoDIT, page 639-643. IEEE, (2016)