default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMoncef Abbas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Ryma Zegai, Imen Khettabi, Lyès Benyoucef, Moncef Abbas:
Fuzzy TOPSIS with Interval Data Based Possibility Measure Approach for Multi-criteria Group Decision Making: Application to Information System Selection. APMS (3) 2024: 270-285- 2023
- [j15]Mohammed Boukedroun
, David Duvivier, Abdessamad Ait El Cadi, Vincent Poirriez, Moncef Abbas:
A hybrid genetic algorithm for stochastic job-shop scheduling problems. RAIRO Oper. Res. 57(4): 1617-1645 (2023)
2010 – 2019
- 2019
- [j14]Moncef Abbas, Zhor Chergui:
The impact of using new significant reference point with TOPSIS methods: study and application. Int. J. Inf. Decis. Sci. 11(2): 95-115 (2019) - 2018
- [c4]Abid Saber, Belkacem Fergani, Moncef Abbas:
Encrypted Traffic Classification: Combining Over-and Under-Sampling through a PCA-SVM. PAIS 2018: 1-5 - 2017
- [j13]Nacira Chikhi, Moncef Abbas, Rachid Benmansour, Saïd Hanafi:
New complexity results on scheduling problem in a robotic cell. RAIRO Oper. Res. 51(3): 749-762 (2017) - 2015
- [j12]Nacira Chikhi, Moncef Abbas, Rachid Benmansour, Abdelghani Bekrar, Saïd Hanafi:
A two-stage flow shop scheduling problem with transportation considerations. 4OR 13(4): 381-402 (2015) - 2014
- [j11]Meriem Ait Mehdi, Mohamed El-Amine Chergui, Moncef Abbas:
An Improved Method for Solving Multiobjective Integer Linear Fractional Programming Problem. Adv. Decis. Sci. 2014: 306456:1-306456:7 (2014) - [c3]Nacira Chikhi, Rachid Benmansour, Abdelghani Bekrar, Saïd Hanafi, Moncef Abbas:
A case study of a two-stage flow shop with dedicated machines and a single robot. CoDIT 2014: 246-250 - 2013
- [j10]Farid Aiche, Moncef Abbas, Didier Dubois:
Chance-constrained programming with fuzzy stochastic coefficients. Fuzzy Optim. Decis. Mak. 12(2): 125-152 (2013) - 2012
- [j9]Moncef Abbas, Mohamed El-Amine Chergui, Meriem Ait Mehdi:
Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming. Int. J. Math. Oper. Res. 4(3): 302-316 (2012) - [c2]Nacira Chikhi, Moncef Abbas:
Minimizing the Makespan in a Robotic Cell Scheduling Problem. CTW 2012: 80-83 - 2011
- [j8]Youssef Hoceini, Mohamed A. Cheragui, Moncef Abbas:
Towards a New Approach for Disambiguation in NLP by Multiple Criterian Decision-Aid. Prague Bull. Math. Linguistics 95: 19-32 (2011)
2000 – 2009
- 2009
- [j7]Moncef Abbas, Zineb Benmeziane:
Hamiltonicity in Partly claw-free graphs. RAIRO Oper. Res. 43(1): 103-113 (2009) - [c1]Youssef Hoceini, Moncef Abbas:
Morphosyntactical Disambiguation Model of Arabic Based on a Multi-criteria Approach. IC-AI 2009: 756-762 - 2007
- [j6]Moncef Abbas, Marc Pirlot, Philippe Vincke:
Tangent circle graphs and 'orders'. Discret. Appl. Math. 155(4): 429-441 (2007) - 2006
- [j5]Moncef Abbas, Fatima Bellahcene:
Cutting plane method for multiple objective stochastic integer linear programming. Eur. J. Oper. Res. 168(3): 967-984 (2006) - [j4]Moncef Abbas, Djamal Chaabane:
Optimizing a linear function over an integer efficient set. Eur. J. Oper. Res. 174(2): 1140-1161 (2006) - 2005
- [j3]Moncef Abbas, Youcef Saoula:
Polynomial algorithms for kernels in comparability, permutation and P4-free graphs. 4OR 3(3): 217-225 (2005) - [j2]Moncef Abbas, Sadek Bouroubi:
On new identities for Bell's polynomials. Discret. Math. 293(1-3): 5-10 (2005) - 2002
- [j1]Moncef Abbas, Djamal Chaabane:
An Algorithm For Solving Multiple Objective Integer Linear Programming Problem. RAIRO Oper. Res. 36(4): 351-364 (2002)
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-10-10 21:13 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:
