Revues Internationales

- J. Zhang, Y. Magnouche, P. Bauguion, S. Martin, J. C. Beck. Computing Bi-Path Multi-Commodity Flows with Constraint Programming-based Branch-and-Price-and-Cut. INFORMS Journal on Computing. To appear, 2023.

- P. Healy, N. Jozefowiez, P. Laroche, F. Marchetti, S. Martin, Z. Róka. A branch-and-cut algorithm for the Connected Max-k-Cut Problem. European Journal of Operational Research 312 (1), pp. 117-124, 2023. https://doi.org/10.1016/j.ejor.2023.06.015

- N. Huin, J. Leguay, S. Martin, P. Medagliani. Routing and slot allocation in 5G hard slicing. Computer Communications 201, pp. 72-90, 2023.

- M. Becker, N. Ginoux, S. Martin and Z. Róka. Tire noise optimization problem: a mixed integer linear programming approach. RAIRO-Operations Research 55 (5), 3073-3085. 2022.

- V. Angilella, F. Krasniqi, P. Medagliani, S. Martin, J. Leguay, R. Shoushou, L. Xuan. High Capacity and Resilient Large-Scale Deterministic IP Networks. Journal of Network and Systems Management 30 (4), 1-28. 2022.

- A. Grange, I. Kacem, S. Martin and S. Minich. Fully Polynomial Time Approximation Scheme for the Pagination Problem with hierarchical structure of tiles. RAIRO-Oper. DOI: https://doi.org/10.1051/ro/2022022 . February 2022.

- S. Martin, Y. Magnouche, C. Juvigny, J. Leguay. Constrained shortest path tour problem: Branch-and-Price algorithm. Computers and Operations Research 144, pp. 105819. 2022.

- J. Krolikowski, S. Martin, P. Medagliani, J. Leguay., S. Chen, X. Chang and X. Geng. "Joint Routing and Scheduling for Large-Scale Deterministic IP Networks". Computer Communications 165, 33-42. 2020.

- D. Cornaz, Y. Magnouche, A. R. Mahjoub and S. Martin. "The multi-terminal vertex separator problem : Branch-and-Cut-and-Price". Discrete Applied Mathematics. 2020, à paraître.

- Y. Magnouche and S. Martin. "Most Vital Vertices for the Shortest s-t Path Problem : Complexity and Branch-and-Cut algorithm". Optimization Letters 14 (8), 2039-2053. 2020.

-P. Laroche, F. Marchetti, S. Martin, A. Nagih, Z. Róka. "Multiple Bipartite Complete Matching Vertex Blocker Problem: Complexity, polyhedral analysis and Branch-and-Cut. Discrete Optimization, Available online 6 August 2019, 100551

- F. Furini, I. Ljubić, S. Martin, P. San Segundo. "The Maximum Clique Interdiction Problem, European Journal of Operational Research. Volume 277, Issue 1, 16 August 2019, Pages 112-127.

- D. Cornaz, Y. Magnouche, A. R. Mahjoub and S. Martin. "The multi-terminal vertex separator problem : Polyhedral analysis and Branch-and-Cut". Discrete Applied Mathematics. 2019, 256 (1).

- D. Cornaz, F. Furini, M. Lacroix, R. Mahjoub, E. Malaguti, S. Martin. "The Vertex $k$-cut Problem".Discrete Optimization.Volume 31, February 2019, Pages 8-28.

- M. A. Hassan, I. Kacem, S. Martin, I. M. Osman. " On the m-clique free interval subgraphs polytope: polyhedral analysis and applications ". Journal of Combinatorial Optimization, DOI: 10.1007/s10878-018-0291-9 (2018).

- A. Grange, I. Kacem, S. Martin. " Algorithms for the Bin Packing Problem with Overlapping Items ". Computers & Industrial Engineering 115: 331-341 (2018).

- L. Alfandari, T. Davidovi, F. Furini, I. Ljubic, V. Maras, S. Martin. "Tighter MIP formulations for Barge Container Ship Routing". Omega https://doi.org/10.1016/j.omega.2017.12.002 (2017).

- M. A. Hassan, I. Kacem, S. Martin, I. M. Osman. " Genetic Algorithms for Job Scheduling in Cloud Computing ". Studies in Informatics and Control, ISSN 1220-1766, vol. 24 (4), pp. 387-400, 2015.

- M. Lacroix, A. R. Mahjoub, S. Martin et C. Picouleau. " On the NP-Completeness of the Perfect Matching Free Subgraph Problem ". Theoretical Computer Science, Vol. 423, pages 25-29 (2012).

- M. Lacroix, A. R. Mahjoub et S. Martin. " Combinatorial Optimization Model and MIP formulation for the Structural Analysis of Conditional Differential-Algebraic Systems ". Computers & Industrial Engineering 61 (2011), pp. 422-429.

Conférences Internationales avec actes

- Y. Magnouche, S. Martin, J. Leguay, P. Medagliani. In-Band Network Telemetry for Efficient Congestion Mitigation. International Network Optimization Conference (INOC 2024). To appear, 2024.

- N. Huin, S. Martin, J. Leguay. Virtual Multi-Topology Routing for QoS Constraints. 37th IEEE/IFIP Network Operations and Management Symposium (NOMS 2024). To appear, 2024.

- M. Y. Naghmouchi, S. Ren, P. Medagliani, S. Martin, J. Leguay. Optimal Admission Control in Damper-Based Networks: Branch-And-Price Algorithm. CODIT 23, pp. 488-493. 2023. (This publication won the best paper award.)

- J. Zhang, Y. Magnouche, S. Martin, A. Fressancourt, C. Beck. The Multi-Commodity Flow Problem with Disjoint Signaling Paths: A Branch-And-Benders-Cut Algorithm. CODIT 23, pp. 477-482. 2023.

- M. Pineda Martín, S. Martin. Unsplittable Multi-Commodity Flow Problem Via Quantum Computing. CODIT 23, pp. 385-390. 2023.

- A. Benhamiche, M. Chopin, S. Martin. Unsplittable Shortest Path Routing: Extended Model and Matheuristic. CODIT 23, pp. 926-931. 2023.

- R. Grappe, M. Lacroix, S. Martin. The Multiple Pairs Shortest Path Problem for Sparse Graphs: Exact Algorithms. CODIT 23, pp. 956-961. 2023.

- I. Bentoumi, F. Furini, A. R. Mahjoub, S. Martin. A Branch-and-Benders-Cut Approach to Solve the Maximum Flow Blocker Problem. CODIT 23, pp. 674-677. 2023.

- Y. Magnouche, S. Martin, J. Leguay. Protected load-balancing problem: Neural-network-based approximation for non-convex optimization. NOMS 2023-2023 IEEE/IFIP Network Operations and Management Symposium (NOMS 2023), pp. 1-9. 2023.

- M. Y. Naghmouchi, S. Ren, P. Medagliani, S. Martin, J. Leguay. Scalable Damper-based Deterministic Networking. 2022 18th International Conference on Network and Service Management (CNSM 2022), pp. 367-373. 2022.

- T. A. Q. Pham, S. Martin, J. Leguay, Xu Gong, Xu Huiying. Intent-Based Routing Policy Optimization in SD-WAN. IEEE ICC 2022. Seoul, South Korea. May 2022.

- Y. Magnouche, S. Martin, J. Leguay, F. De-Pellegrini, R. El-Azouzi, C. Richier. Branch-and-Benders-Cut Algorithm for the Weighted Coflow Completion Time Minimization Problem. INOC 2022. Aachen, Germany. March 2022.

- S. Martin, P. Medagliani, J. Leguay. Network Slicing for Deterministic Latency. CNSM HiPNet 2021. Izmir, Turkey. October 2021.

- B. Liu, S. Ren, C. Wang, V. Angillela, P. Medagliani, S. Martin, J. Leguay. Towards Large-Scale Deterministic IP Networks. IFIP Networking 2021. Helsinki, Finland. June 2021.

- A. Grange, I. Kacem, S. Martin, S. Minich. Approximate solutions for a special pagination problem with 2 symbols per tile. ICNSC 2021: 1-4

- S. Chen, J. Leguay, S. Martin and P. Medagliani. Load Balancing for Deterministic Networks. TENSOR (IFIP Networking Workshop). Paris, France. June 2020.

- N. Huin, J. Leguay, S. Martin, P. Medagliani, S. Cai. Routing and Slot Allocation in 5G Hard Slicing. INOC 2019.

- A. Grange, I. Kacem, S. Martin, S. Minich. Fully polynomial-time approximation scheme for the pagination problem. Proceedings of International Conference on Computers and Industrial Engineering, CIE 2019

- F. Furini, E. Malaguti, S. Martin and I. C. Ternier. ILP Models and Column Generation for the Minimum Sum Coloring Problem. à paraître INOC 2017

- P. Laroche, F. Marchetti, S. Martin et Z. Roka. " Bipartite Complete Matching Vertex Interdiction Problem with Incompatibility Constraints: Complexity and Heuristics ". IEEE International Conference Control, Decision and Information Technologies Proceedings CODIT 2017, à paraître (2017)

- M. Hassan, I. Kacem, S. Martin and I. M.Osman. " Mathematical Formulation for Open Shop Scheduling Problem ". IEEE International Conference Control, Decision and Information Technologies Proceedings CODIT 2017, à paraître (2017)

- M. Becker, N. Ginoux, S. Martin and Zs. Roka. Optimization of Tire Noise by Solving an Integer Linear Program (ILP) 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC2016), 9-12 Octobre 2016, Budapest (Hongrie)

- Y. Magnouche and S. Martin. "The Multi-terminal vertex separator problem: Polytope characterization and TDI-ness". Proceedings ISCO 2016, LNCS à paraître (2016)

- M. Hassan, I. Kacem, S. Martin and I. M.Osman. "Unrelated Parallel Machine Scheduling Problem With precedence Constraints: Polyhedral Analysis and Branch-and-Cut". Proceedings ISCO 2016, LNCS à paraître (2016)

- Y. Magnouche, A. R. Mahjoub and S. Martin. "The Multi-terminal vertex separator problem: Extended formulations and Branch-and-Cut-and-Price". Proceedings CODIT 2016, à paraître (2016)

- M. Hassan, I. Kacem, S. Martin and I. M.Osman. "Valid Inequalities for Unrelated Parallel Machines Scheduling with Precedence Constraints". Proceedings CODIT 2016, à paraître (2016)

- D. Cornaz, Y. Magnouche, A. R. Mahjoub and S. Martin. " The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut ". Proceedings of 45th International Conference on Computers & Industrial Engineering (CIE45), ISBN:9781510817456 pages 857-864 (2015).

- M. Hassan Abdel-Jabbar, I. Kacem, S. Martin and I. M. Osman. " Mathematical Formulations for the Unrelated Parallel Machines with Precedence Constraints ". Proceedings of 45th International Conference on Computers & Industrial Engineering (CIE45), ISBN:9781510817456 pages 1005-1012 (2015).

- P. Laroche, F. Marchetti, S. Martin, Z. Roka and M. Zheng. " Complexity and Heuristics for Multi Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment ". Proceedings of 45th International Conference on Computers & Industrial Engineering (CIE45), ISBN:9781510817456 pages 1294-1301 (2015).

- A. Grange, I. Kacem, K. Laurent, S. Martin. " On the knapsack problem under merging objects' constrants ". Proceedings of 45th International Conference on Computers & Industrial Engineering (CIE45), ISBN:9781510817456 pages 1359-1366 (2015).

- P. Laroche, F. Marchetti, S. Martin et Z. Roka. " Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment ". IEEE International Conference Control, Decision and Information Technologies (CoDIT'14) pages 182-187, (2014).

- D. Cornaz, F. Furini, M. Lacroix, E. Malaguti, A. R. Mahjoub et S. Martin. “Mathematical formulations for the Balanced Vertex k-Separator Problem”. IEEE International Conference Control, Decision and Information Technologies (CoDIT'14) pages 176-181, (2014).

- M. A. Hassan Abdel-Jabbar, I. Kacem et S. Martin. " Unrelated parallel machines with precedence constraints: Application to cloud computing ". IEEE CLOUDNET 2014pages 438-442, (2014).

- M. Lacroix, A. R. Mahjoub et S. Martin. " Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem ". Lecture Notes on Computer Science (International Symposium of Combinatorial Optimization (ISCO) 2012), (2012).

- M. Lacroix, A. R. Mahjoub et S. Martin. " Structural analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets ". Proceedings ISCO 2010, Electronic Notes in Discrete Mathematics 36, pages 1073-1080.

- M. Lacroix, A. R. Mahjoub et S. Martin. "Structural analysis in Differential-Algebraic Systems and Combinatorial Optimization". Proceedings of 39th International Conference on Computers & Industrial Engineering (CIE39), pages 331-337 (2009). (cette publication a gagnée le prix du meilleur papier étudiant dans la conférence)

- P. Fouilhoux, S. Martin et M. Coupechoux "Combinatorial problems and integer formulations in wireless mesh network design". NCP07 (International Conference on Nonconvex Programming) (2007).