default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDToufik Saadi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2008
[b1]Toufik Saadi:
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
Journal Articles
- 2020
- [j5]Isma Dahmani, Mhand Hifi
, Toufik Saadi, Labib Yousef:
A swarm optimization-based search algorithm for the quadratic knapsack problem with conflict Graphs. Expert Syst. Appl. 148: 113224 (2020) - 2012
- [j4]Mhand Hifi, Stéphane Nègre, Rachid Ouafi, Toufik Saadi:
A parallel algorithm for constrained two-staged two-dimensional cutting problems. Comput. Ind. Eng. 62(1): 177-189 (2012) - [j3]Mhand Hifi, Toufik Saadi:
A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems. Comput. Optim. Appl. 51(2): 783-807 (2012) - 2009
- [j2]Mhand Hifi, Rym M'Hallah, Toufik Saadi:
Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem. Comput. Optim. Appl. 42(2): 303-326 (2009) - 2008
- [j1]Mhand Hifi, Rym M'Hallah, Toufik Saadi:
Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem. INFORMS J. Comput. 20(2): 212-221 (2008)
Conference and Workshop Papers
- 2020
- [c10]Mhand Hifi, Amir Mohamed-Youssouf, Toufik Saadi, Labib Yousef:
A Cooperative Swarm Optimization-Based Algorithm for the Quadratic Multiple Knapsack Problem. CoDIT 2020: 1168-1173 - 2017
- [c9]Najat Al-Iedani, Mhand Hifi, Toufik Saadi:
A reactive search for the quadratic knapsack problem. CoDIT 2017: 495-499 - 2016
- [c8]Najat Al-Iedani, Mhand Hifi, Toufik Saadi:
Neighborhood search-based heuristic for the k-clustering minimum biclique completion problem. CoDIT 2016: 639-643 - 2015
- [c7]Mhand Hifi, Ibrahim Moussa, Toufik Saadi, Sagvan Saleh:
An Adaptive Neighborhood Search for k-Clustering Minimum Bi-clique Completion Problems. MCO (1) 2015: 15-25 - 2014
- [c6]Mhand Hifi, Ibrahim Moussa, Toufik Saadi:
A Two-Stage Resolution Search-Based Heuristic for the Team Orienteering Problem. FiCloud 2014: 442-447 - [c5]Mhand Hifi, Stéphane Nègre, Toufik Saadi, Sagvan Saleh, Lei Wu:
A Parallel Large Neighborhood Search-Based Heuristic for the Disjunctively Constrained Knapsack Problem. IPDPS Workshops 2014: 1547-1551 - 2013
- [c4]Didier El Baz, Julien Bourgeois, Toufik Saadi, Alessandro Bassi:
ALMA, A Logistic Mobile Application Based on Internet of Things. GreenCom/iThings/CPScom 2013: 355-358 - 2012
- [c3]Didier El Baz, Mhand Hifi, Toufik Saadi:
Peer-to-Peer Solution of 2D Cutting Stocks Problems. CTW 2012: 116-120 - 2011
- [c2]Mhand Hifi, Toufik Saadi, Nawel Haddadou:
High Performance Peer-to-Peer Distributed Computing with Application to Constrained Two-Dimensional Guillotine Cutting Problem. PDP 2011: 552-559 - 1999
- [c1]Samy Ait-Aoudia, Brahim Hamid, Adel Moussaoui, Toufik Saadi:
Solving Geometric Constraints by a Graph-Constructive Approach. IV 1999: 250-257
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
