default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilippe Fortemps
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j24]Landelin Delcoucq
, Thomas Dupiereux-Fettweis, Fabian Lecron, Philippe Fortemps:
Resource and activity clustering based on a hierarchical cell formation algorithm. Appl. Intell. 53(1): 532-541 (2023)- 2021
- [j23]Sonda Elloumi, Taïcir Loukil, Philippe Fortemps:
Reactive heuristics for disrupted multi-mode resource-constrained project scheduling problem. Expert Syst. Appl. 167: 114132 (2021) - 2020
- [j22]Sarah Itani, Fabian Lecron, Philippe Fortemps:
A one-class classification decision tree based on kernel density estimation. Appl. Soft Comput. 91: 106250 (2020) - [c7]Landelin Delcoucq, Fabian Lecron, Philippe Fortemps, Wil M. P. van der Aalst:
Resource-centric process mining: clustering using local process models. SAC 2020: 45-52
2010 – 2019
- 2019
- [j21]Sarah Itani, Fabian Lecron, Philippe Fortemps:
Specifics of medical data mining for diagnosis aid: A survey. Expert Syst. Appl. 118: 300-314 (2019) - [j20]Souhir Ben Souissi, Mourad Abed, Lahcen Elhiki, Philippe Fortemps, Marc Pirlot:
PARS, a system combining semantic technologies with multiple criteria decision aiding for supporting antibiotic prescriptions. J. Biomed. Informatics 99 (2019) - [c6]Sarah Itani, Fabian Lecron, Philippe Fortemps:
Data Mining for ADHD & ASD Prediction Based on Resting-State fMRI Signals: A Literature Review. BNAIC/BENELEARN 2019 - 2018
- [j19]Sarah Itani, Fabian Lecron, Philippe Fortemps:
A multi-level classification framework for multi-site medical data: Application to the ADHD-200 collection. Expert Syst. Appl. 91: 36-45 (2018) - [i1]Sarah Itani, Fabian Lecron, Philippe Fortemps:
A One-Class Decision Tree Based on Kernel Density Estimation. CoRR abs/1805.05021 (2018) - 2017
- [j18]Sonda Elloumi, Philippe Fortemps, Taïcir Loukil:
Multi-objective algorithms to multi-mode resource-constrained projects under mode change disruption. Comput. Ind. Eng. 106: 161-173 (2017) - [c5]Souhir Ben Souissi, Mourad Abed, Lahcen Elhiki, Philippe Fortemps, Marc Pirlot:
Reducing the toxicity risk in antibiotic prescriptions by combining ontologies with a Multiple Criteria Decision Model. AMIA 2017 - 2016
- [c4]Souhir Ben Souissi, Mourad Abed, Lahcen Elhiki, Philippe Fortemps, Marc Pirlot:
Categorizing the suitability of an alternative for a subject. SSCI 2016: 1-8 - 2014
- [c3]Massimo Gurrieri, Philippe Fortemps, Xavier Siebert:
Alternative Decomposition Techniques for Label Ranking. IPMU (2) 2014: 464-474 - 2012
- [c2]Massimo Gurrieri, Xavier Siebert, Philippe Fortemps, Salvatore Greco, Roman Slowinski:
Label Ranking: A New Rule-Based Label Ranking Method. IPMU (1) 2012: 613-623 - 2010
- [j17]Sonda Elloumi, Philippe Fortemps:
A hybrid rank-based evolutionary algorithm applied to multi-mode resource-constrained project scheduling problem. Eur. J. Oper. Res. 205(1): 31-41 (2010) - [j16]Géraldine Bous, Philippe Fortemps, François Glineur, Marc Pirlot:
ACUTA: A novel method for eliciting additive value functions on the basis of holistic preference statements. Eur. J. Oper. Res. 206(2): 435-444 (2010)
2000 – 2009
- 2008
- [j15]Philippe Fortemps, Salvatore Greco, Roman Slowinski:
Multicriteria decision support using rules that represent rough-graded preference relations. Eur. J. Oper. Res. 188(1): 206-223 (2008) - 2007
- [j14]Taïcir Loukil, Jacques Teghem, Philippe Fortemps:
A multi-objective production scheduling case study solved by simulated annealing. Eur. J. Oper. Res. 179(3): 709-722 (2007) - 2005
- [j13]Didier Dubois, Philippe Fortemps:
Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints. Eur. J. Oper. Res. 160(3): 582-598 (2005) - 2004
- [j12]Philippe Fortemps, Marc Pirlot:
Conjoint axiomatization of Min, DiscriMin and LexiMin. Fuzzy Sets Syst. 148(2): 211-229 (2004) - [c1]Philippe Fortemps, Salvatore Greco, Roman Slowinski:
Multicriteria Choice and Ranking Using Decision Rules Induced from Rough Approximation of Graded Preference Relations. Rough Sets and Current Trends in Computing 2004: 510-522 - 2003
- [j11]Philippe Fortemps:
Fuzzy sets in scheduling and planning. Eur. J. Oper. Res. 147(2): 229-230 (2003) - [j10]Didier Dubois, Hélène Fargier, Philippe Fortemps:
Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge. Eur. J. Oper. Res. 147(2): 231-252 (2003) - [j9]Cristina Stanciulescu, Philippe Fortemps, M. Installé, Vincent Wertz:
Multiobjective fuzzy linear programming problems with fuzzy decision variables. Eur. J. Oper. Res. 149(3): 654-675 (2003) - 2002
- [j8]Philippe Fortemps, Roman Slowinski:
A Graded Quadrivalent Logic for Ordinal Preference Modelling: Loyola-Like Approach. Fuzzy Optim. Decis. Mak. 1(1): 93-111 (2002) - [j7]Pierre L. Kunsch, Philippe Fortemps:
A fuzzy decision support system for the economic calculus in radioactive waste management. Inf. Sci. 142(1-4): 103-116 (2002) - 2001
- [j6]Didier Dubois, Philippe Fortemps, Marc Pirlot, Henri Prade:
Leximin optimality and fuzzy set-theoretic operations. Eur. J. Oper. Res. 130(1): 20-28 (2001) - [j5]Philippe Fortemps:
A book-review section for our journal. Fuzzy Sets Syst. 123(3): 395-396 (2001) - 2000
- [j4]Daniel Tuyttens, Jacques Teghem, Philippe Fortemps, K. Van Nieuwenhuyze:
Performance of the MOSA Method for the Bicriteria Assignment Problem. J. Heuristics 6(3): 295-310 (2000)
1990 – 1999
- 1999
- [j3]Didier Dubois, Philippe Fortemps:
Computing improved optimal solutions to max-min flexible constraint satisfaction problems. Eur. J. Oper. Res. 118(1): 95-126 (1999) - 1997
- [j2]Philippe Fortemps:
Jobshop scheduling with imprecise durations: a fuzzy approach. IEEE Trans. Fuzzy Syst. 5(4): 557-569 (1997) - 1996
- [j1]Philippe Fortemps, Marc Roubens:
Ranking and defuzzification methods based on area compensation. Fuzzy Sets Syst. 82(3): 319-330 (1996)
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-07 21:25 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:
