Liste des publications

2018

[KMM18] S. Kedad-Sidhoum, F. Monna, G. MouniÃ©, D. Trystram. "A Family of Scheduling Algorithms for Hybrid Parallel Platforms", International Journal of Foundations of Computer Science, vol. 29(1), pp. 63-90, 2018, (doi:/10.1142/S012905411850003X)

[WWB16] D. Watel, M. Weisser, C. Bentz, D. Barth. "Directed Steiner trees with diffusion costs", Journal of Combinatorial Optimization, vol. 32(4), pp. 1089-1106, 2016, (doi:10.1007/s10878-015-9925-3)

[WP16] D. Watel, P. Poirion. "The Maximum Matrix Contraction problem", 4th International Symposium on Combinatorial Optimization, May 2016, pp.1-12, France,

[WP16a] D. Watel, P. Poirion. "The Maximum Matrix Contraction problem : Appendix", Date de dépot: 2016/06/02, Nb pages 12, (Tech. Rep.: CEDRIC-16-3645)

[WW14] D. Watel, M. Weisser. "A practical greedy approximation for the Directed Steiner Tree problem", Combinatorial optimization and applications (COCOA), November 2014, pp.200-215, Series Lecture Notes in Computer Science, Wailea, Hawai, USA, (DOI: 10.1007/978-3-319-12691-3_16)
[WWB14] D. Watel, M. Weisser, C. Bentz, D. Barth. "Directed Steiner Tree with Branching Constraint", Computing and combinatorics (COCOON), August 2014, pp.263-275, Series Lecture notes in computer science, (DOI: 10.1007/978-3-319-08783-2_23)

[ANP13] L. Alfandari, A. Nagih, A. Plateau, J. Sadki. "Hybrid column generation for large-size Covering Integer Programs: application to Transportation Planning", Computers & Operations Research, vol. 40(8), pp. 1938-1946, 2013, (doi:http://dx.doi.org/10.1016/j.cor.2013.02.020)

[PAN13] A. Plateau, L. Alfandari, A. Nagih, J. Sadki. "Hybrid column generation for large-size Covering Integer Programs", European Chapter on Combinatorial Optimization, May 2013, pp.34-35, Paris, France,

[ANP11] L. Alfandari, A. Nagih, A. Plateau, J. Sadki. "Hybridization of column generation and approximation heuristics for large-size Covering Integer Programs", MIC 2011 : The IX Metaheuristics International Conference, July 2011, pp.531-533, Udine, Italy,

[Cru10] M. Crucianu. "Kernel Approximation by Locality Sensitive Hashing with Application to Active Learning", Date de dépot: 2010/01/01, Nb pages 10, (Tech. Rep.: CEDRIC-10-1898)

[BR08] A. Billionnet, F. Roupin. "A Deterministic Approximation Algorithm for the Densest k-Subgraph Problem", International Journal of Operational Research, vol. 3(3), pp. 301-314, 2008, (doi:10.1504/IJOR.2008.017534)