default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFatiha Bendali
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Christophe Cariou, Laure Moiroux-Arvis, Fatiha Bendali, Jean Mailfert:
Optimal Route Planning of an Unmanned Aerial Vehicle for Data Collection of Agricultural Sensors. INFOCOM (Workshops) 2024: 1-6- [c9]Fatiha Bendali, Alejandro Olivas Gonzales, Alain Quilliot, Hélène Toussaint:
Surrogate Constraints for Synchronized Energy Production/Consumption. ISCO 2024: 335-347 - 2022
- [c8]Fatiha Bendali, Jean Mailfert, Eloise Mole Kamga, Alain Quilliot, Hélène Toussaint:
A Synchronized Knapsack Problem. CoDIT 2022: 687-692 - [c7]Alain Quilliot, Fatiha Bendali, Jean Mailfert, Eloise Mole Kamga, Alejandro Olivas Gonzalez
, Hélène Toussaint:
Surrogate Estimators for Complex Bi-Level Energy Management. FedCSIS (Communication Papers) 2022: 85-92 - [c6]Fatiha Bendali, Eloise Mole Kamga, Jean Mailfert, Alejandro Olivas Gonzalez, Alain Quilliot, Hélène Toussaint:
Surrogate Estimators for Complex Bi-level Energy Management. WCO 2022: 171-196 - 2021
- [j18]Fatiha Bendali, Eloise Mole Kamga, Jean Mailfert, Alain Quilliot, Hélène Toussaint:
Synchronizing energy production and vehicle routing. RAIRO Oper. Res. 55(4): 2141-2163 (2021) - [j17]Fatiha Bendali, Eloise Mole Kamga, Jean Mailfert, Alain Quilliot, Hélène Toussaint:
Pipe-lining dynamic programming processes to synchronize both the production and the consumption of energy. RAIRO Oper. Res. 55(4): 2359-2383 (2021) - 2020
- [c5]Eloise Mole Kamga, Fatiha Bendali, Jean Mailfert, Alain Quilliot, Hélène Toussaint:
Simultaneous Management of Energy Production and Consumption. CoDIT 2020: 403-408 - [c4]Fatiha Bendali, Eloise Mole Kamga, Jean Mailfert, Alain Quilliot, Hélène Toussaint:
Dynamic Programming for the Synchronization of Energy Production and Consumption Processes. WCO@FedCSIS 2020: 257-280 - [c3]Alain Quilliot, Fatiha Bendali, Jean Mailfert, Eloise Mole Kamga, Hélène Toussaint:
Pipe-lining Dynamic Programming Processes in Order to Synchronize Energy Production and Consumption. FedCSIS 2020: 303-306
2010 – 2019
- 2018
- [j16]Fatiha Bendali, Jean Mailfert:
The weakly connected independent set polytope in corona and join of graphs. J. Comb. Optim. 36(3): 1007-1023 (2018) - 2016
- [j15]Fatiha Bendali, Jean Mailfert, Djelloul Mameri:
The minimum weakly connected independent set problem: Polyhedral results and Branch-and-Cut. Discret. Optim. 22: 87-110 (2016) - 2015
- [j14]Fatiha Bendali, Jean Mailfert, Djelloul Mameri:
On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm. RAIRO Oper. Res. 49(2): 313-334 (2015) - 2012
- [j13]Fatiha Bendali, Jean Mailfert, X. Tang:
Composition of graphs and the Hop-constrained Path Problem. Int. J. Math. Oper. Res. 4(3): 225-246 (2012) - 2010
- [j12]Fatiha Bendali, I. Diarrassouba, Ali Ridha Mahjoub, Jean Mailfert:
The k edge-disjoint 3-hop-constrained paths polytope. Discret. Optim. 7(4): 222-233 (2010) - [j11]Fatiha Bendali, I. Diarrassouba, Ali Ridha Mahjoub, Mohamed Didi Biha, Jean Mailfert:
A branch-and-cut algorithm for the k-edge connected subgraph problem. Networks 55(1): 13-32 (2010)
2000 – 2009
- 2009
- [j10]Alain Quilliot, Fatiha Bendali, Jean Mailfert:
Extended cooperative networks games. Discret. Appl. Math. 157(4): 728-737 (2009) - [j9]Fatiha Bendali, Jean Mailfert:
Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron. J. Comb. Optim. 18(1): 1-22 (2009) - [j8]Andréa C. Santos, Fatiha Bendali, Jean Mailfert, Christophe Duhamel, Kean Mean Hou:
Heuristics for Designing Energy-efficient Wireless Sensor Network Topologies. J. Networks 4(6): 436-444 (2009) - 2008
- [c2]Fatiha Bendali, Christophe Duhamel, Kean Mean Hou, Jean Mailfert, Andréa C. Santos:
An Optimization Approach for Designing Wireless Sensor Networks. NTMS 2008: 1-6 - 2007
- [j7]Alain Quilliot, Fatiha Bendali, Jean Mailfert:
Cooperative networks games with elastic demands. RAIRO Oper. Res. 41(4): 345-360 (2007) - [c1]Fatiha Bendali, Ibrahima Diarrassouba, Mohamed Didi Biha, Ali Ridha Mahjoub, Jean Mailfert:
The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut. DRCN 2007: 1-8 - 2005
- [j6]Alain Quilliot, Fatiha Bendali, Jean Mailfert:
Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité. RAIRO Oper. Res. 39(3): 185-224 (2005) - 2002
- [j5]Fatiha Bendali, Ali Ridha Mahjoub, Jean Mailfert:
Composition of Graphs and the Triangle-Free Subgraph Polytope. J. Comb. Optim. 6(4): 359-381 (2002) - 2001
- [j4]Fatiha Bendali, Jean Mailfert, Alain Quilliot:
Tarification par des jeux Coopératifs avec Demandes Élastiques. RAIRO Oper. Res. 35(3): 367-381 (2001) - 2000
- [j3]Fatiha Bendali, Ali Ridha Mahjoub, Jean Mailfert:
Composition of graphs and the triangle free subgraph polytope. Electron. Notes Discret. Math. 5: 19-22 (2000) - [j2]Nicolas Preux, Fatiha Bendali, Jean Mailfert, Alain Quilliot:
Coeur et nucléolus des jeux de recouvrement. RAIRO Oper. Res. 34(3): 363-383 (2000)
1990 – 1999
- 1994
- [j1]Fatiha Bendali, Alain Quilliot:
Compatibilité entre structures d'intervalles et relations d'orde. Discret. Math. 130(1-3): 19-37 (1994)
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-08-21 20:29 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:
