Youcef Magnouche

34 papers B 3C 10Journal 16Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
On the Multi-Commodity Flow With Convex Objective Function: Column-Generation Approaches.
Networks
Guillaume Beraud-Sudreau, Lucas Létocart, Youcef Magnouche, Sébastien Martin
2026 J jnl
On the Multi-Commodity Flow with convex objective function: Column-Generation approaches.
CoRR
Guillaume Beraud-Sudreau, Lucas Létocart, Youcef Magnouche, Sébastien Martin
2025 J jnl
Atomic Column Generation For Consensus Between Algorithms: Application to Path Computation.
CoRR
Sébastien Martin, Pierre Bauguion, Youcef Magnouche, Jérémie Leguay
2025 J jnl
Atomic Column Generation for Consensus Between Algorithms: Application to Path Computation.
Networks
Sébastien Martin, Pierre Bauguion, Youcef Magnouche, Jérémie Leguay
2025 J jnl
Design of survivable networks with low connectivity requirements.
Int. Trans. Oper. Res.
Fatmah Almathkour, Youcef Magnouche, Ali Ridha Mahjoub, Raouia Taktak
2025 J jnl
On the k-maximally-disjoint weighted spanning trees problem: variants, complexity and algorithms.
Ann. Oper. Res.
Walid Astaoui, Youcef Magnouche, Sébastien Martin
2025 — conf
Scalable Verification of Routing Loops in Multi-Protocol Multi-Instance IP Networks.
ITC-36
Youcef Magnouche, Sébastien Martin, Jérémie Leguay, Cong Mei
2025 C conf
Spatial Dantzig-Wolfe decomposition for multi-commodity flow problem.
CoDIT
Youcef Magnouche, Sébastien Martin
2025 J jnl
The multi-terminal vertex separator problem: total dual integrality and polytope composition.
J. Comb. Optim.
Youcef Magnouche, Ali Ridha Mahjoub, Sébastien Martin
2024 C conf
Alternative paths computation for congestion mitigation in segment-routing networks.
CoDIT
Sébastien Martin, Youcef Magnouche, Paolo Medagliani, Jérémie Leguay
2024 J jnl
Alternative paths computation for congestion mitigation in segment-routing networks.
CoRR
Sébastien Martin, Youcef Magnouche, Paolo Medagliani, Jérémie Leguay
2024 J jnl
Computing Bipath Multicommodity Flows with Constraint Programming-Based Branch-and-Price-and-Cut.
INFORMS J. Comput.
Jiachen Zhang, Youcef Magnouche, Pierre Bauguion, Sébastien Martin, J. Christopher Beck
2024 B conf
Demo: Fast Routing-Loops Identification in Multi-Protocol Multi-Instance IP Networks.
ICNP
Youcef Magnouche, Sébastien Martin, Jérémie Leguay, Mei Cong, Guofeng Qian
2024 J jnl
Distributed Tactical TE With Segment Routing.
IEEE Trans. Netw. Serv. Manag.
Paolo Medagliani, Sébastien Martin, Youcef Magnouche, Jérémie Leguay, Bruno Decraene
2024 C conf
In-Band Network Telemetry for Efficient Congestion Mitigation.
INOC
Youcef Magnouche, Sébastien Martin, Jeremie Leguay, Paolo Medagliani
2024 J jnl
Semi-Distributed Coflow Scheduling in Datacenters.
IEEE Trans. Netw. Serv. Manag.
Rachid El Azouzi, Francesco De Pellegrini, Afaf Arfaoui, Cédric Richier, Jeremie Leguay, Quang-Trung Luu, Youcef Magnouche, Sébastien Martin
2024 C conf
The Multi-commodity Flow Problem: Double Dantzig-Wolfe decomposition.
CoDIT
Fan Zhang, Jiazheng Wang, Mathieu Lacroix, Roberto Wolfler Calvo, Youcef Magnouche, Sébastien Martin
2023 J jnl
Protected load balancing problem: Neural-network based approximation for non-convex optimization.
CoRR
Youcef Magnouche, Sébastien Martin, Jérémie Leguay
2023 B conf
Protected load-balancing problem: Neural-network based approximation for non-convex optimization.
NOMS
Youcef Magnouche, Sébastien Martin, Jérémie Leguay
2023 — conf
Safe Routing in Energy-aware IP networks.
DRCN
Youcef Magnouche, Jérémie Leguay, Feng Zeng
2023 C conf
The Multi-Commodity Flow Problem with Disjoint Signaling Paths: A Branch-and-Benders-Cut Algorithm.
CoDIT
Jiachen Zhang, Youcef Magnouche, Sébastien Martin, Antoine Fressancourt, J. Christopher Beck
2022 C conf
Branch-and-Benders-Cut Algorithm for the Weighted Coflow Completion Time Minimization Problem.
INOC
Youcef Magnouche, Sébastien Martin, Jérémie Leguay, Francesco De Pellegrini, Rachid Elazouzi, Cédric Richier
2022 J jnl
Constrained shortest path tour problem: Branch-and-Price algorithm.
Comput. Oper. Res.
Sébastien Martin, Youcef Magnouche, Corentin Juvigny, Jérémie Leguay
2021 — conf
Distributed Load Balancing From the Edge in IP Networks.
ICC
Youcef Magnouche, Pham Tran Anh Quang, Jérémie Leguay, Xu Gong, Feng Zeng
2021 B conf
Distributed Utility Maximization From the Edge in IP Networks.
IM
Youcef Magnouche, Pham Tran Anh Quang, Jérémie Leguay, Xu Gong, Feng Zeng
2021 J jnl
The multi-terminal vertex separator problem: Branch-and-Cut-and-Price.
Discret. Appl. Math.
Youcef Magnouche, Ali Ridha Mahjoub, Sébastien Martin
2020 — conf
Model predictive control for load balancing.
SIGCOMM Posters and Demos
Pham Tran Anh Quang, Youcef Magnouche, Jeremie Leguay, Xu Gong, Feng Zeng
2020 J jnl
Most vital vertices for the shortest s-t path problem: complexity and Branch-and-Cut algorithm.
Optim. Lett.
Youcef Magnouche, Sébastien Martin
2019 J jnl
The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut.
Discret. Appl. Math.
Denis Cornaz, Youcef Magnouche, Ali Ridha Mahjoub, Sébastien Martin
2018 C conf
The Minimum Rooted-Cycle Cover Problem.
ISCO
Denis Cornaz, Youcef Magnouche
2017 — —
The multi-terminal vertex separator problem : Complexity, Polyhedra and Algorithms. (Le problème du séparateur de poids minimum : Complexité, Polyèdres et Algorithmes).
Youcef Magnouche
2016 C conf
The Multi-terminal Vertex Separator Problem: Polytope Characterization and TDI-ness.
ISCO
Youcef Magnouche, Sébastien Martin
2016 C conf
The multi-terminal vertex separator problem: Extended formulations and Branch-and-Cut-and-Price.
CoDIT
Youcef Magnouche, Ali Ridha Mahjoub, Sébastien Martin
2014 C conf
On minimal two-edge-connected graphs.
CoDIT
Denis Cornaz, Youcef Magnouche, Ali Ridha Mahjoub