Urmăriți
Sébastien martin
Sébastien martin
Chercheur chez Huawei
Adresă de e-mail confirmată pe univ-lorraine.fr - Pagina de pornire
Titlu
Citat de
Citat de
Anul
The maximum clique interdiction problem
F Furini, I Ljubić, S Martin, P San Segundo
European Journal of Operational Research 277 (1), 112-127, 2019
352019
The maximum clique interdiction problem
F Furini, I Ljubić, S Martin, P San Segundo
European Journal of Operational Research 277 (1), 112-127, 2019
352019
Tighter MIP models for barge container ship routing
L Alfandari, T Davidović, F Furini, I Ljubić, V Maraą, S Martin
Omega 82, 38-54, 2019
342019
Joint routing and scheduling for large-scale deterministic ip networks
J Krolikowski, S Martin, P Medagliani, J Leguay, S Chen, X Chang, ...
Computer Communications 165, 33-42, 2021
312021
Algorithms for the bin packing problem with overlapping items
A Grange, I Kacem, S Martin
Computers & Industrial Engineering 115, 331-341, 2018
252018
Unrelated parallel machines with precedence constraints: application to cloud computing
MAH Abdel-Jabbar, I Kacem, S Martin
2014 IEEE 3rd International Conference on Cloud Networking (CloudNet), 438-442, 2014
202014
Unrelated parallel machines with precedence constraints: application to cloud computing
MAH Abdel-Jabbar, I Kacem, S Martin
2014 IEEE 3rd International Conference on Cloud Networking (CloudNet), 438-442, 2014
202014
Hard-isolation for Network Slicing
N Huin, P Medagliani, S Martin, J Leguay, L Shi, S Cai, J Xu, H Shi
IEEE INFOCOM 2019-IEEE Conference on Computer Communications Workshops …, 2019
192019
On the NP-completeness of the perfect matching free subgraph problem
M Lacroix, AR Mahjoub, S Martin, C Picouleau
Theoretical Computer Science 423, 25-29, 2012
182012
The multi-terminal vertex separator problem: Polyhedral analysis and branch-and-cut
D Cornaz, Y Magnouche, AR Mahjoub, S Martin
Discrete Applied Mathematics 256, 11-37, 2019
152019
The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut
D Cornaz, Y Magnouche, AR Mahjoub, S Martin
Discrete Applied Mathematics 256, 11-37, 2019
152019
The vertex k-cut problem
D Cornaz, F Furini, M Lacroix, E Malaguti, AR Mahjoub, S Martin
Discrete Optimization 31, 8-28, 2019
132019
Genetic Algorithms for Job Scheduling in Cloud Computing
MA Hassan, I Kacem, S Martin, IM Osman
Studies in Informatics and Control 24 (4), 387-400, 2015
122015
Towards Large-Scale Deterministic IP Networks
B Liu, S Ren, C Wang, V Angilella, P Medagliani, S Martin, J Leguay
2021 IFIP Networking Conference (IFIP Networking), 1-9, 2021
102021
ILP Models and Column Generation for the Minimum Sum Coloring Problem
F Furini, E Malaguti, S Martin, IC Ternier
Electronic Notes in Discrete Mathematics 64, 215-224, 2018
102018
Mathematical formulations for the balanced vertex k-separator problem
D Cornaz, F Furini, M Lacroix, E Malaguti, AR Mahjoub, S Martin
2014 International Conference on Control, Decision and Information …, 2014
102014
Bipartite complete matching vertex interdiction problem: Application to robust nurse assignment
P Laroche, F Marchetti, S Martin, Z Róka
2014 International Conference on Control, Decision and Information …, 2014
72014
Unrelated parallel machine scheduling problem with precedence constraints: polyhedral analysis and branch-and-cut
MA Hassan, I Kacem, S Martin, IM Osman
Combinatorial Optimization: 4th International Symposium, ISCO 2016, Vietri …, 2016
62016
Analyse structurelle des systèmes algébro-différentiels conditionnels: complexité, modèles et polyèdres
S Martin
Université Paris-Dauphine, 2011
62011
Load Balancing for Deterministic Networks
S Chen, J Leguay, S Martin, P Medagliani
2020 IFIP Networking Conference (Networking), 785-790, 2020
52020
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–20