default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMonia Bellalouna
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c11]Mohamed Abdellahi Amar
, Walid Khaznaji, Monia Bellalouna:
A Parallel Branch and Bound Algorithm for the Probabilistic TSP. ICA3PP (1) 2018: 437-448- [c10]Soumaya Sassi Mahfoudh, Monia Bellalouna:
A Hybrid Heuristic for the Probabilistic Capacitated Vehicle Routing Problem with Two-Dimensional Loading Constraints. ICCS (3) 2018: 241-253 - [c9]Soumaya Sassi Mahfoudh, Monia Bellalouna, Leila Horchani:
Solving CSS-Sprite Packing Problem Using a Transformation to the Probabilistic Non-oriented Bin Packing Problem. ICCS (2) 2018: 561-573 - [c8]Mohamed Abdellahi Amar, Walid Khaznaji, Monia Bellalouna:
An Improved Partitioning Heuristic for Solving TSP: An Empirical Study. SNPD 2018: 105-110 - 2017
- [c7]Mohamed Abdellahi Amar, Walid Khaznaji, Monia Bellalouna:
A parallel hybrid heuristic based on Karp's partitioning for PTSP on multi-core processors. ICIS 2017: 465-470 - [c6]Mohamed Abdellahi Amar, Walid Khaznaji, Monia Bellalouna:
An Exact Resolution for the Probabilistic Traveling Salesman Problem under the A Priori Strategy. ICCS 2017: 1414-1423 - 2016
- [c5]Afef Ghabri, Leila Horchani, Monia Bellalouna:
New fault tolerant strategy of wireless sensor network. ICIS 2016: 1-6 - 2015
- [c4]Afef Ghabri, Monia Bellalouna:
Wireless sensor networks modeling as a probabilistic combinatorial optimization problem. SNPD 2015: 652-656 - [c3]Soumaya Sassi Mahfoudh, Walid Khaznaji, Monia Bellalouna:
A branch and bound algorithm for the probabilistic traveling salesman problem. SNPD 2015: 697-702 - [i3]Zied Bouyahia, Monia Bellalouna, Khaled Ghédira:
Stability of probablisitic two-stage permutation flowshop problem. CTW 2015: 101-104 - [i2]Soumaya Sassi Mahfoudh, Walid Khaznaji, Monia Bellalouna:
A Java Implementation of the Branch and Bound Algorithm : the Probabilistic Traveling Salesman Problem. CTW 2015: 277-280 - [i1]Monia Bellalouna, Walid Khaznaji, Mohamed Abdellahi Amar:
A Snail Heuristic for the Euclidean Traveling Salesman Problem. CTW 2015: 281-284 - 2014
- [c2]Abir Henchiri, Monia Bellalouna, Walid Khaznaji:
A probabilistic traveling salesman problem: a survey. FedCSIS (Position Papers) 2014: 55-60 - 2013
- [j2]Zied Bouyahia, Monia Bellalouna, Khaled Ghédira:
Load balancing a priori strategy for the probabilistic weighted flowtime problem. Comput. Ind. Eng. 64(1): 1-10 (2013) - 2010
- [j1]Zied Bouyahia, Monia Bellalouna, Patrick Jaillet, Khaled Ghédira:
A priori parallel machines scheduling. Comput. Ind. Eng. 58(3): 488-500 (2010)
2000 – 2009
- 2009
- [c1]Zied Bouyahia, Monia Bellalouna, Khaled Ghédira, Patrick Jaillet:
A Priori Strategies for the Probabilistic Total Weighted Flowtime on Parallel Identical Machines Problem. FCS 2009: 145-151
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 2025-01-09 13:01 CET 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:
