![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Eric Sanlaville
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j25]Jakub Wawrzyniak, Maciej Drozdowski
, Eric Sanlaville, Yoann Pigné, Frédéric Guinand:
Quay partitioning problem. Int. Trans. Oper. Res. 31(3): 1554-1584 (2024) - [j24]Quentin Bourgeais
, Rodolphe Charrier, Eric Sanlaville, Ludovic Seifert:
A temporal graph model to study the dynamics of collective behavior and performance in team sports: an application to basketball. Soc. Netw. Anal. Min. 14(1): 94 (2024) - [j23]Stefan Balev, Eric Sanlaville, Jason Schoeters:
Temporally connected components. Theor. Comput. Sci. 1013: 114757 (2024) - [c8]Esteban Christiann, Eric Sanlaville, Jason Schoeters:
On Inefficiently Connecting Temporal Networks. SAND 2024: 8:1-8:19 - [c7]Stefan Balev, Yoann Pigné, Eric Sanlaville, Mathilde Vernet:
Brief Announcement: The Dynamic Steiner Tree Problem: Definitions, Complexity, Algorithms. SAND 2024: 24:1-24:6 - [i4]Quentin Bourgeais, Eric Sanlaville, Rodolphe Charrier, Ludovic Seifert:
A Temporal Graph Model to Study the Dynamics of Collective Behavior and Performance in Team Sports: An Application to Basketball. CoRR abs/2404.01909 (2024) - 2023
- [j22]Mathilde Vernet
, Yoann Pigné, Eric Sanlaville:
A study of connectivity on dynamic graphs: computing persistent connected components. 4OR 21(2): 205-233 (2023) - [i3]Esteban Christiann, Eric Sanlaville, Jason Schoeters:
On inefficiently connecting temporal networks. CoRR abs/2312.07117 (2023) - 2022
- [j21]Jakub Wawrzyniak, Maciej Drozdowski, Eric Sanlaville:
A container ship traffic model for simulation studies. Int. J. Appl. Math. Comput. Sci. 32(4) (2022) - [j20]Kamil Piechowiak, Maciej Drozdowski, Eric Sanlaville
:
Framework of algorithm portfolios for strip packing problem. Comput. Ind. Eng. 172(Part): 108538 (2022) - 2021
- [j19]Mathilde Vernet
, Maciej Drozdowski, Yoann Pigné
, Eric Sanlaville:
A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs. Discret. Appl. Math. 296: 203-216 (2021) - 2020
- [j18]Jakub Wawrzyniak, Maciej Drozdowski
, Eric Sanlaville:
Selecting algorithms for large berth allocation problems. Eur. J. Oper. Res. 283(3): 844-862 (2020) - [c6]Juan Luis Jiménez Laredo
, Juan Julián Merelo Guervós
, Carlos M. Fernandes
, Eric Sanlaville
:
A Method for Estimating the Computational Complexity of Multimodal Functions. EvoApplications 2020: 197-211 - [c5]Stefan Balev, Juan Luis Jiménez Laredo, Ioannis Lamprou, Yoann Pigné, Eric Sanlaville:
Cops and Robbers on Dynamic Graphs: Offline and Online Case. SIROCCO 2020: 203-219
2010 – 2019
- 2019
- [j17]Xavier Schepler, Nabil Absi
, Dominique Feillet, Eric Sanlaville:
The stochastic discrete berth allocation problem. EURO J. Transp. Logist. 8(4): 363-396 (2019) - [j16]Rabah Ammour
, Edouard Leclercq
, Eric Sanlaville
, Dimitri Lefebvre
:
Datation of Faults for Markovian Stochastic DESs. IEEE Trans. Autom. Control. 64(7): 2961-2967 (2019) - [i2]Fares Zaidi, Laurent Amanton, Eric Sanlaville:
Towards a Novel Cooperative Logistics Information System Framework. CoRR abs/1905.00687 (2019) - 2018
- [j15]Rabah Ammour
, Edouard Leclercq, Eric Sanlaville, Dimitri Lefebvre:
Faults prognosis using partially observed stochastic Petri-nets: an incremental approach. Discret. Event Dyn. Syst. 28(2): 247-267 (2018) - 2017
- [j14]Rabah Ammour
, Edouard Leclercq, Eric Sanlaville, Dimitri Lefebvre:
Fault prognosis of timed stochastic discrete event systems with bounded estimation error. Autom. 82: 35-41 (2017) - [j13]Rabah Ammour
, Edouard Leclercq, Eric Sanlaville, Dimitri Lefebvre:
State estimation of discrete event systems for RUL prediction issue. Int. J. Prod. Res. 55(23): 7040-7057 (2017) - 2016
- [c4]Rabah Ammour
, Edouard Leclercq, Eric Sanlaville
, Dimitri Lefebvre:
Faults prognosis using partially observed stochastic Petri nets. WODES 2016: 472-477 - 2015
- [c3]Rabah Ammour
, Edouard Leclercq, Eric Sanlaville
, Dimitri Lefebvre:
Estimation of the fault occurrence dates in DESs with partially observed stochastic Petri nets. ADHS 2015: 254-259 - 2014
- [c2]Mahdi Abed Salman
, Cyrille Bertelle
, Eric Sanlaville
:
The Behavior of Load Balancing Strategies with Regard to the Network Structure in Distributed Computing Systems. SITIS 2014: 432-439 - [i1]Mansoriya Hamidou, Dominique Fournier, Eric Sanlaville, Frédéric Serin:
Management of dangerous goods in container terminal with MAS model. CoRR abs/1403.7152 (2014) - 2012
- [j12]Emmanuel Medernach, Eric Sanlaville
:
Fair resource allocation for different scenarios of demands. Eur. J. Oper. Res. 218(2): 339-350 (2012)
2000 – 2009
- 2009
- [j11]Aziz Moukrim
, Eric Sanlaville
:
A polynomial algorithm for recognizing the Am-order class. Discret. Math. 309(12): 4200-4204 (2009) - 2008
- [j10]Jean Damay, Alain Quilliot, Eric Sanlaville
:
Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results. RAIRO Oper. Res. 42(3): 325-359 (2008) - 2007
- [j9]Jean Damay, Alain Quilliot, Eric Sanlaville
:
Linear programming based algorithms for preemptive and non-preemptive RCPSP. Eur. J. Oper. Res. 182(3): 1012-1022 (2007) - 2005
- [j8]Eric Sanlaville
:
Sensitivity bounds for machine scheduling with uncertain communication delays. J. Sched. 8(5): 461-473 (2005) - 2004
- [j7]Emmanuel Poder, Nicolas Beldiceanu, Eric Sanlaville
:
Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption. Eur. J. Oper. Res. 153(1): 239-254 (2004) - [j6]Frédéric Guinand
, Aziz Moukrim
, Eric Sanlaville
:
Sensitivity analysis of tree scheduling on two machines with communication delays. Parallel Comput. 30(1): 103-120 (2004) - 2003
- [j5]Aziz Moukrim
, Eric Sanlaville
, Frédéric Guinand
:
Parallel Machine Scheduling with Uncertain Communication Delays. RAIRO Oper. Res. 37(1): 1-16 (2003)
1990 – 1999
- 1999
- [c1]Aziz Moukrim, Eric Sanlaville, Frédéric Guinand:
Scheduling with Communication Delays and On-Line Disturbances. Euro-Par 1999: 350-357 - 1998
- [j4]Eric Sanlaville, Günter Schmidt
:
Machine Scheduling with Availability Constraints. Acta Informatica 35(9): 795-811 (1998) - 1997
- [j3]Zhen Liu, Eric Sanlaville:
Stochastic Scheduling with Variable Profile and Precedence Constraints. SIAM J. Comput. 26(1): 173-187 (1997) - 1995
- [j2]Eric Sanlaville
:
Nearly on Line Scheduling of Preemptive Independent Tasks. Discret. Appl. Math. 57(2-3): 229-241 (1995) - [j1]Zhen Liu, Eric Sanlaville
:
Preemptive Scheduling with Variable Profile, Precedence Constraints and Due Dates. Discret. Appl. Math. 58(3): 253-280 (1995)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-16 19:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint