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.rss
dblp: Eric Sanlaville https://dblp.org/pid/05/336.html dblp person page RSS feed Mon, 07 Oct 2024 21:21:21 +0200 en-US daily 1 released under the CC0 1.0 license dblp@dagstuhl.de (dblp team) dblp@dagstuhl.de (dblp team) Computers/Computer_Science/Publications/Bibliographies http://www.rssboard.org/rss-specification https://dblp.org/img/logo.144x51.pngdblp: Eric Sanlavillehttps://dblp.org/pid/05/336.html14451 Quay partitioning problem.https://doi.org/10.1111/itor.13389, , , , :
Quay partitioning problem. Int. Trans. Oper. Res. 31(3): 1554-1584 ()]]>https://dblp.org/rec/journals/itor/WawrzyniakDSPG24Wed, 01 May 2024 01:00:00 +0200 A temporal graph model to study the dynamics of collective behavior and performance in team sports: an application to basketball.https://doi.org/10.1007/s13278-024-01253-6, , , :
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 ()]]>https://dblp.org/rec/journals/snam/BourgeaisCSS23Sun, 01 Dec 2024 00:00:00 +0100 Temporally connected components.https://doi.org/10.1016/j.tcs.2024.114757, , :
Temporally connected components. Theor. Comput. Sci. 1013: 114757 ()]]>https://dblp.org/rec/journals/tcs/BalevSS24Mon, 01 Jan 2024 00:00:00 +0100 On Inefficiently Connecting Temporal Networks.https://doi.org/10.4230/LIPIcs.SAND.2024.8, , :
On Inefficiently Connecting Temporal Networks. SAND : 8:1-8:19]]>https://dblp.org/rec/conf/sand/ChristiannSS24Mon, 01 Jan 2024 00:00:00 +0100 Brief Announcement: The Dynamic Steiner Tree Problem: Definitions, Complexity, Algorithms.https://doi.org/10.4230/LIPIcs.SAND.2024.24, , , :
Brief Announcement: The Dynamic Steiner Tree Problem: Definitions, Complexity, Algorithms. SAND : 24:1-24:6]]>https://dblp.org/rec/conf/sand/BalevPSV24Mon, 01 Jan 2024 00:00:00 +0100 A Temporal Graph Model to Study the Dynamics of Collective Behavior and Performance in Team Sports: An Application to Basketball.https://doi.org/10.48550/arXiv.2404.01909, , , :
A Temporal Graph Model to Study the Dynamics of Collective Behavior and Performance in Team Sports: An Application to Basketball. CoRR abs/2404.01909 ()]]>https://dblp.org/rec/journals/corr/abs-2404-01909Mon, 01 Jan 2024 00:00:00 +0100 A study of connectivity on dynamic graphs: computing persistent connected components.https://doi.org/10.1007/s10288-022-00507-3, , :
A study of connectivity on dynamic graphs: computing persistent connected components. 4OR 21(2): 205-233 ()]]>https://dblp.org/rec/journals/4or/VernetPS23Thu, 01 Jun 2023 01:00:00 +0200 On inefficiently connecting temporal networks.https://doi.org/10.48550/arXiv.2312.07117, , :
On inefficiently connecting temporal networks. CoRR abs/2312.07117 ()]]>https://dblp.org/rec/journals/corr/abs-2312-07117Sun, 01 Jan 2023 00:00:00 +0100 A container ship traffic model for simulation studies.https://doi.org/10.34768/amcs-2022-0038, , :
A container ship traffic model for simulation studies. Int. J. Appl. Math. Comput. Sci. 32(4) ()]]>https://dblp.org/rec/journals/amcs/WawrzyniakDS22Sat, 01 Jan 2022 00:00:00 +0100 Framework of algorithm portfolios for strip packing problem.https://doi.org/10.1016/j.cie.2022.108538, , :
Framework of algorithm portfolios for strip packing problem. Comput. Ind. Eng. 172(Part): 108538 ()]]>https://dblp.org/rec/journals/candie/PiechowiakDS22Sat, 01 Jan 2022 00:00:00 +0100 A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs.https://doi.org/10.1016/j.dam.2019.12.012, , , :
A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs. Discret. Appl. Math. 296: 203-216 ()]]>https://dblp.org/rec/journals/dam/VernetDPS21Fri, 01 Jan 2021 00:00:00 +0100 Selecting algorithms for large berth allocation problems.https://doi.org/10.1016/j.ejor.2019.11.055, , :
Selecting algorithms for large berth allocation problems. Eur. J. Oper. Res. 283(3): 844-862 ()]]>https://dblp.org/rec/journals/eor/WawrzyniakDS20Wed, 01 Jan 2020 00:00:00 +0100 A Method for Estimating the Computational Complexity of Multimodal Functions.https://doi.org/10.1007/978-3-030-43722-0_13, , , :
A Method for Estimating the Computational Complexity of Multimodal Functions. EvoApplications : 197-211]]>https://dblp.org/rec/conf/evoW/LaredoGFS20Wed, 01 Jan 2020 00:00:00 +0100 Cops and Robbers on Dynamic Graphs: Offline and Online Case.https://doi.org/10.1007/978-3-030-54921-3_12, , , , :
Cops and Robbers on Dynamic Graphs: Offline and Online Case. SIROCCO : 203-219]]>https://dblp.org/rec/conf/sirocco/BalevLLPS20Wed, 01 Jan 2020 00:00:00 +0100 The stochastic discrete berth allocation problem.https://doi.org/10.1007/s13676-018-0128-9, , , :
The stochastic discrete berth allocation problem. EURO J. Transp. Logist. 8(4): 363-396 ()]]>https://dblp.org/rec/journals/ejtl/ScheplerAFS19Tue, 01 Jan 2019 00:00:00 +0100 Datation of Faults for Markovian Stochastic DESs.https://doi.org/10.1109/TAC.2018.2872490, , , :
Datation of Faults for Markovian Stochastic DESs. IEEE Trans. Autom. Control. 64(7): 2961-2967 ()]]>https://dblp.org/rec/journals/tac/AmmourLSL19Tue, 01 Jan 2019 00:00:00 +0100 Towards a Novel Cooperative Logistics Information System Framework.http://arxiv.org/abs/1905.00687, , :
Towards a Novel Cooperative Logistics Information System Framework. CoRR abs/1905.00687 ()]]>https://dblp.org/rec/journals/corr/abs-1905-00687Tue, 01 Jan 2019 00:00:00 +0100 Faults prognosis using partially observed stochastic Petri-nets: an incremental approach.https://doi.org/10.1007/s10626-017-0252-y, , , :
Faults prognosis using partially observed stochastic Petri-nets: an incremental approach. Discret. Event Dyn. Syst. 28(2): 247-267 ()]]>https://dblp.org/rec/journals/deds/AmmourLSL18Mon, 01 Jan 2018 00:00:00 +0100 Fault prognosis of timed stochastic discrete event systems with bounded estimation error.https://doi.org/10.1016/j.automatica.2017.04.028, , , :
Fault prognosis of timed stochastic discrete event systems with bounded estimation error. Autom. 82: 35-41 ()]]>https://dblp.org/rec/journals/automatica/AmmourLSL17Sun, 01 Jan 2017 00:00:00 +0100 State estimation of discrete event systems for RUL prediction issue.https://doi.org/10.1080/00207543.2017.1346835, , , :
State estimation of discrete event systems for RUL prediction issue. Int. J. Prod. Res. 55(23): 7040-7057 ()]]>https://dblp.org/rec/journals/ijpr/AmmourLSL17Sun, 01 Jan 2017 00:00:00 +0100 Faults prognosis using partially observed stochastic Petri nets.https://doi.org/10.1109/WODES.2016.7497890, , , :
Faults prognosis using partially observed stochastic Petri nets. WODES : 472-477]]>https://dblp.org/rec/conf/wodes/AmmourLSL16Fri, 01 Jan 2016 00:00:00 +0100 Estimation of the fault occurrence dates in DESs with partially observed stochastic Petri nets.https://doi.org/10.1016/j.ifacol.2015.11.184, , , :
Estimation of the fault occurrence dates in DESs with partially observed stochastic Petri nets. ADHS : 254-259]]>https://dblp.org/rec/conf/adhs/AmmourLSL15Thu, 01 Jan 2015 00:00:00 +0100 The Behavior of Load Balancing Strategies with Regard to the Network Structure in Distributed Computing Systems.https://doi.org/10.1109/SITIS.2014.42, , :
The Behavior of Load Balancing Strategies with Regard to the Network Structure in Distributed Computing Systems. SITIS : 432-439]]>https://dblp.org/rec/conf/sitis/SalmanBS14Wed, 01 Jan 2014 00:00:00 +0100 Management of dangerous goods in container terminal with MAS model.http://arxiv.org/abs/1403.7152, , , :
Management of dangerous goods in container terminal with MAS model. CoRR abs/1403.7152 ()]]>https://dblp.org/rec/journals/corr/HamidouFSS14Wed, 01 Jan 2014 00:00:00 +0100 Fair resource allocation for different scenarios of demands.https://doi.org/10.1016/j.ejor.2011.10.029, :
Fair resource allocation for different scenarios of demands. Eur. J. Oper. Res. 218(2): 339-350 ()]]>https://dblp.org/rec/journals/eor/MedernachS12Sun, 01 Jan 2012 00:00:00 +0100 A polynomial algorithm for recognizing the Am-order class.https://doi.org/10.1016/j.disc.2008.10.032, :
A polynomial algorithm for recognizing the Am-order class. Discret. Math. 309(12): 4200-4204 ()]]>https://dblp.org/rec/journals/dm/MoukrimS09Thu, 01 Jan 2009 00:00:00 +0100 Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results.https://doi.org/10.1051/ro:2008024, , :
Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results. RAIRO Oper. Res. 42(3): 325-359 ()]]>https://dblp.org/rec/journals/rairo/DamayQS08Tue, 01 Jan 2008 00:00:00 +0100 Linear programming based algorithms for preemptive and non-preemptive RCPSP.https://doi.org/10.1016/j.ejor.2006.09.052, , :
Linear programming based algorithms for preemptive and non-preemptive RCPSP. Eur. J. Oper. Res. 182(3): 1012-1022 ()]]>https://dblp.org/rec/journals/eor/DamayQS07Mon, 01 Jan 2007 00:00:00 +0100 Sensitivity bounds for machine scheduling with uncertain communication delays.https://doi.org/10.1007/s10951-005-2864-6:
Sensitivity bounds for machine scheduling with uncertain communication delays. J. Sched. 8(5): 461-473 ()]]>https://dblp.org/rec/journals/scheduling/Sanlaville05Sat, 01 Jan 2005 00:00:00 +0100 Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption.https://doi.org/10.1016/S0377-2217(02)00756-7, , :
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 ()]]>https://dblp.org/rec/journals/eor/PoderBS04Thu, 01 Jan 2004 00:00:00 +0100 Sensitivity analysis of tree scheduling on two machines with communication delays.https://doi.org/10.1016/S0167-8191(03)00091-7, , :
Sensitivity analysis of tree scheduling on two machines with communication delays. Parallel Comput. 30(1): 103-120 ()]]>https://dblp.org/rec/journals/pc/GuinandMS04Thu, 01 Jan 2004 00:00:00 +0100 Parallel Machine Scheduling with Uncertain Communication Delays.https://doi.org/10.1051/ro:2003011, , :
Parallel Machine Scheduling with Uncertain Communication Delays. RAIRO Oper. Res. 37(1): 1-16 ()]]>https://dblp.org/rec/journals/rairo/MoukrimSG03Wed, 01 Jan 2003 00:00:00 +0100 Scheduling with Communication Delays and On-Line Disturbances.https://doi.org/10.1007/3-540-48311-X_45, , :
Scheduling with Communication Delays and On-Line Disturbances. Euro-Par : 350-357]]>https://dblp.org/rec/conf/europar/MoukrimSG99Fri, 01 Jan 1999 00:00:00 +0100 Machine Scheduling with Availability Constraints.https://doi.org/10.1007/s002360050143, :
Machine Scheduling with Availability Constraints. Acta Informatica 35(9): 795-811 ()]]>https://dblp.org/rec/journals/acta/SanlavilleS98Thu, 01 Jan 1998 00:00:00 +0100 Stochastic Scheduling with Variable Profile and Precedence Constraints.https://doi.org/10.1137/S0097539791218949, :
Stochastic Scheduling with Variable Profile and Precedence Constraints. SIAM J. Comput. 26(1): 173-187 ()]]>https://dblp.org/rec/journals/siamcomp/LiuS97Wed, 01 Jan 1997 00:00:00 +0100 Nearly on Line Scheduling of Preemptive Independent Tasks.https://doi.org/10.1016/0166-218X(94)00105-M:
Nearly on Line Scheduling of Preemptive Independent Tasks. Discret. Appl. Math. 57(2-3): 229-241 ()]]>https://dblp.org/rec/journals/dam/Sanlaville95Sun, 01 Jan 1995 00:00:00 +0100 Preemptive Scheduling with Variable Profile, Precedence Constraints and Due Dates.https://doi.org/10.1016/0166-218X(93)E0151-N, :
Preemptive Scheduling with Variable Profile, Precedence Constraints and Due Dates. Discret. Appl. Math. 58(3): 253-280 ()]]>https://dblp.org/rec/journals/dam/LiuS95Sun, 01 Jan 1995 00:00:00 +0100