iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://dblp.dagstuhl.de/pid/05/336.xml
Eric Sanlaville
Jakub Wawrzyniak Maciej Drozdowski Eric Sanlaville Yoann Pigné Frédéric Guinand Quay partitioning problem. 1554-1584 2024 May 31 Int. Trans. Oper. Res. 3 https://doi.org/10.1111/itor.13389 db/journals/itor/itor31.html#WawrzyniakDSPG24
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. 94 2024 December 14 Soc. Netw. Anal. Min. 1 https://doi.org/10.1007/s13278-024-01253-6 db/journals/snam/snam14.html#BourgeaisCSS23
Stefan Balev Eric Sanlaville Jason Schoeters Temporally connected components. 114757 2024 1013 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2024.114757 db/journals/tcs/tcs1013.html#BalevSS24 streams/journals/tcs
Esteban Christiann Eric Sanlaville Jason Schoeters On Inefficiently Connecting Temporal Networks. 8:1-8:19 2024 SAND https://doi.org/10.4230/LIPIcs.SAND.2024.8 conf/sand/2024 db/conf/sand/sand2024.html#ChristiannSS24 Stefan Balev Yoann Pigné Eric Sanlaville Mathilde Vernet Brief Announcement: The Dynamic Steiner Tree Problem: Definitions, Complexity, Algorithms. 24:1-24:6 2024 SAND https://doi.org/10.4230/LIPIcs.SAND.2024.24 conf/sand/2024 db/conf/sand/sand2024.html#BalevPSV24
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. 2024 abs/2404.01909 CoRR https://doi.org/10.48550/arXiv.2404.01909 db/journals/corr/corr2404.html#abs-2404-01909
Mathilde Vernet Yoann Pigné Eric Sanlaville A study of connectivity on dynamic graphs: computing persistent connected components. 205-233 2023 June 21 4OR 2 https://doi.org/10.1007/s10288-022-00507-3 db/journals/4or/4or21.html#VernetPS23
Esteban Christiann Eric Sanlaville Jason Schoeters On inefficiently connecting temporal networks. 2023 abs/2312.07117 CoRR https://doi.org/10.48550/arXiv.2312.07117 db/journals/corr/corr2312.html#abs-2312-07117
Jakub Wawrzyniak Maciej Drozdowski Eric Sanlaville A container ship traffic model for simulation studies. 2022 32 Int. J. Appl. Math. Comput. Sci. 4 https://doi.org/10.34768/amcs-2022-0038 db/journals/amcs/amcs32.html#WawrzyniakDS22
Kamil Piechowiak Maciej Drozdowski Eric Sanlaville Framework of algorithm portfolios for strip packing problem. 108538 2022 172 Comput. Ind. Eng. Part https://doi.org/10.1016/j.cie.2022.108538 https://www.wikidata.org/entity/Q113878037 db/journals/candie/candie172.html#PiechowiakDS22
Mathilde Vernet Maciej Drozdowski Yoann Pigné Eric Sanlaville A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs. 203-216 2021 296 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2019.12.012 db/journals/dam/dam296.html#VernetDPS21
Jakub Wawrzyniak Maciej Drozdowski Eric Sanlaville Selecting algorithms for large berth allocation problems. 844-862 2020 283 Eur. J. Oper. Res. 3 https://doi.org/10.1016/j.ejor.2019.11.055 db/journals/eor/eor283.html#WawrzyniakDS20
Juan Luis Jiménez Laredo Juan Julián Merelo Guervós Carlos M. Fernandes 0001 Eric Sanlaville A Method for Estimating the Computational Complexity of Multimodal Functions. 197-211 2020 EvoApplications https://doi.org/10.1007/978-3-030-43722-0_13 conf/evoW/2020a db/conf/evoW/evoappl2020.html#LaredoGFS20 Stefan Balev Juan Luis Jiménez Laredo Ioannis Lamprou 0001 Yoann Pigné Eric Sanlaville Cops and Robbers on Dynamic Graphs: Offline and Online Case. 203-219 2020 SIROCCO https://doi.org/10.1007/978-3-030-54921-3_12 conf/sirocco/2020 db/conf/sirocco/sirocco2020.html#BalevLLPS20
Xavier Schepler Nabil Absi Dominique Feillet Eric Sanlaville The stochastic discrete berth allocation problem. 363-396 2019 8 EURO J. Transp. Logist. 4 https://doi.org/10.1007/s13676-018-0128-9 db/journals/ejtl/ejtl8.html#ScheplerAFS19
Rabah Ammour Edouard Leclercq Eric Sanlaville Dimitri Lefebvre Datation of Faults for Markovian Stochastic DESs. 2961-2967 2019 64 IEEE Trans. Autom. Control. 7 https://doi.org/10.1109/TAC.2018.2872490 db/journals/tac/tac64.html#AmmourLSL19
Fares Zaidi Laurent Amanton Eric Sanlaville Towards a Novel Cooperative Logistics Information System Framework. 2019 abs/1905.00687 CoRR http://arxiv.org/abs/1905.00687 db/journals/corr/corr1905.html#abs-1905-00687
Rabah Ammour Edouard Leclercq Eric Sanlaville Dimitri Lefebvre Faults prognosis using partially observed stochastic Petri-nets: an incremental approach. 247-267 2018 28 Discret. Event Dyn. Syst. 2 https://doi.org/10.1007/s10626-017-0252-y db/journals/deds/deds28.html#AmmourLSL18
Rabah Ammour Edouard Leclercq Eric Sanlaville Dimitri Lefebvre Fault prognosis of timed stochastic discrete event systems with bounded estimation error. 35-41 2017 82 Autom. https://doi.org/10.1016/j.automatica.2017.04.028 db/journals/automatica/automatica82.html#AmmourLSL17
Rabah Ammour Edouard Leclercq Eric Sanlaville Dimitri Lefebvre State estimation of discrete event systems for RUL prediction issue. 7040-7057 2017 55 Int. J. Prod. Res. 23 https://doi.org/10.1080/00207543.2017.1346835 db/journals/ijpr/ijpr55.html#AmmourLSL17
Rabah Ammour Edouard Leclercq Eric Sanlaville Dimitri Lefebvre Faults prognosis using partially observed stochastic Petri nets. 472-477 2016 WODES https://doi.org/10.1109/WODES.2016.7497890 conf/wodes/2016 db/conf/wodes/wodes2016.html#AmmourLSL16 Rabah Ammour Edouard Leclercq Eric Sanlaville Dimitri Lefebvre Estimation of the fault occurrence dates in DESs with partially observed stochastic Petri nets. 254-259 2015 ADHS https://doi.org/10.1016/j.ifacol.2015.11.184 conf/adhs/2015 db/conf/adhs/adhs2015.html#AmmourLSL15 Mahdi Abed Salman Cyrille Bertelle Eric Sanlaville The Behavior of Load Balancing Strategies with Regard to the Network Structure in Distributed Computing Systems. 432-439 2014 SITIS https://doi.org/10.1109/SITIS.2014.42 https://doi.ieeecomputersociety.org/10.1109/SITIS.2014.42 conf/sitis/2014 db/conf/sitis/sitis2014.html#SalmanBS14
Mansoriya Hamidou Dominique Fournier Eric Sanlaville Frédéric Serin Management of dangerous goods in container terminal with MAS model. 2014 abs/1403.7152 CoRR http://arxiv.org/abs/1403.7152 db/journals/corr/corr1403.html#HamidouFSS14
Emmanuel Medernach Eric Sanlaville Fair resource allocation for different scenarios of demands. 339-350 2012 218 Eur. J. Oper. Res. 2 https://doi.org/10.1016/j.ejor.2011.10.029 db/journals/eor/eor218.html#MedernachS12
Aziz Moukrim Eric Sanlaville A polynomial algorithm for recognizing the A<sub>m</sub>-order class. 4200-4204 2009 309 Discret. Math. 12 https://doi.org/10.1016/j.disc.2008.10.032 db/journals/dm/dm309.html#MoukrimS09
Jean Damay Alain Quilliot Eric Sanlaville Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results. 325-359 2008 42 RAIRO Oper. Res. 3 https://doi.org/10.1051/ro:2008024 db/journals/rairo/rairo42.html#DamayQS08
Jean Damay Alain Quilliot Eric Sanlaville Linear programming based algorithms for preemptive and non-preemptive RCPSP. 1012-1022 2007 182 Eur. J. Oper. Res. 3 https://doi.org/10.1016/j.ejor.2006.09.052 db/journals/eor/eor182.html#DamayQS07
Eric Sanlaville Sensitivity bounds for machine scheduling with uncertain communication delays. 461-473 2005 8 J. Sched. 5 https://doi.org/10.1007/s10951-005-2864-6 db/journals/scheduling/scheduling8.html#Sanlaville05
Emmanuel Poder Nicolas Beldiceanu Eric Sanlaville Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption. 239-254 2004 153 Eur. J. Oper. Res. 1 https://doi.org/10.1016/S0377-2217(02)00756-7 db/journals/eor/eor153.html#PoderBS04
Frédéric Guinand Aziz Moukrim Eric Sanlaville Sensitivity analysis of tree scheduling on two machines with communication delays. 103-120 2004 30 Parallel Comput. 1 https://doi.org/10.1016/S0167-8191(03)00091-7 db/journals/pc/pc30.html#GuinandMS04
Aziz Moukrim Eric Sanlaville Frédéric Guinand Parallel Machine Scheduling with Uncertain Communication Delays. 1-16 2003 37 RAIRO Oper. Res. 1 https://doi.org/10.1051/ro:2003011 db/journals/rairo/rairo37.html#MoukrimSG03
Aziz Moukrim Eric Sanlaville Frédéric Guinand Scheduling with Communication Delays and On-Line Disturbances. 350-357 1999 conf/europar/1999 Euro-Par https://doi.org/10.1007/3-540-48311-X_45 db/conf/europar/europar99.html#MoukrimSG99
Eric Sanlaville Günter Schmidt 0002 Machine Scheduling with Availability Constraints. 795-811 1998 35 Acta Informatica 9 https://doi.org/10.1007/s002360050143 db/journals/acta/acta35.html#SanlavilleS98
Zhen Liu 0001 Eric Sanlaville Stochastic Scheduling with Variable Profile and Precedence Constraints. 173-187 1997 26 SIAM J. Comput. 1 db/journals/siamcomp/siamcomp26.html#LiuS97 https://doi.org/10.1137/S0097539791218949
Eric Sanlaville Nearly on Line Scheduling of Preemptive Independent Tasks. 229-241 1995 57 Discret. Appl. Math. 2-3 https://doi.org/10.1016/0166-218X(94)00105-M db/journals/dam/dam57.html#Sanlaville95
Zhen Liu 0001 Eric Sanlaville Preemptive Scheduling with Variable Profile, Precedence Constraints and Due Dates. 253-280 1995 58 Discret. Appl. Math. 3 https://doi.org/10.1016/0166-218X(93)E0151-N db/journals/dam/dam58.html#LiuS95
Nabil Absi Laurent Amanton Rabah Ammour Stefan Balev Nicolas Beldiceanu Cyrille Bertelle Quentin Bourgeais Rodolphe Charrier Esteban Christiann Jean Damay Maciej Drozdowski Dominique Feillet Carlos M. Fernandes 0001 Dominique Fournier Juan Julián Merelo Guervós Frédéric Guinand Mansoriya Hamidou Ioannis Lamprou 0001 Juan Luis Jiménez Laredo Edouard Leclercq Dimitri Lefebvre Zhen Liu 0001 Emmanuel Medernach Aziz Moukrim Kamil Piechowiak Yoann Pigné Emmanuel Poder Alain Quilliot Mahdi Abed Salman Xavier Schepler Günter Schmidt 0002 Jason Schoeters Ludovic Seifert Frédéric Serin Mathilde Vernet Jakub Wawrzyniak Fares Zaidi