2024
Congestion Prevention at Ingress Peering Links.
Proceedings of the 34th International Telecommunication Networks and Applications Conference, 2024
2023
Two extended formulations for the virtual network function placement and routing problem.
Networks, July, 2023
2022
An approximation algorithm for the maximum spectral subgraph problem.
J. Comb. Optim., 2022
2021
Statistically Efficient, Polynomial-Time Algorithms for Combinatorial Semi-Bandits.
Proc. ACM Meas. Anal. Comput. Syst., 2021
Benders decomposition for a node-capacitated Virtual Network Function placement and routing problem.
Comput. Oper. Res., 2021
The Offline Virtual Network Function Packing Problem.
Proceedings of the 24th Conference on Innovation in Clouds, 2021
Asymptotically Optimal Strategies For Combinatorial Semi-Bandits in Polynomial Time.
Proceedings of the Algorithmic Learning Theory, 2021
2020
Virtual Network Functions Placement and Routing Problem: Path formulation.
Proceedings of the 2020 IFIP Networking Conference, 2020
2019
A study on load-balanced variants of the bin packing problem.
Discret. Appl. Math., 2019
Key technologies to accelerate the ICT Green evolution - An operator's point of view.
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
CoRR, 2019
2018
Virtual function placement for service chaining with partial orders and anti-affinity rules.
Networks, 2018
A Branch-and-Cut algorithm for the Capacitated Multi-Failure Survivable Network Design problem.
Comput. Ind. Eng., 2018
Design of reliable communication networks.
Ann. des Télécommunications, 2018
Relaxation and Matrix Randomized Rounding for the Maximum Spectral Subgraph Problem.
Proceedings of the Combinatorial Optimization and Applications, 2018
2017
The Economics of CDNs and Their Impact on Service Fairness.
IEEE Trans. Netw. Serv. Manag., 2017
2016
Proceedings of the 12th International Conference on the Design of Reliable Communication Networks, 2016
2015
Efficient algorithms for the maximum concurrent flow problem.
Networks, 2015
Optimal hierarchical deployment of caches for video streaming.
Proceedings of the 6th International Conference on the Network of the Future, 2015
2014
The location-dispatching problem: Polyhedral results and content delivery network design.
Discret. Appl. Math., 2014
Does network coding improve the throughput of a survivable multicast network ?
Proceedings of the 10th International Conference on the Design of Reliable Communication Networks, 2014
2013
A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source Maximum Concurrent Flow.
Electron. Notes Discret. Math., 2013
Strategic network coding - How much and where to code to obtain most of the benefits.
Proceedings of the International Symposium on Network Coding, 2013
2012
Some further investigation on maximum throughput: Does network coding really help ?
Proceedings of the 24th International Teletraffic Congress, 2012
2011
A branch-and-cut algorithm for the partitioning-hub location-routing problem.
Comput. Oper. Res., 2011
Cache Location in Tree Networks: Preliminary Results.
Proceedings of the Network Optimization - 5th International Conference, 2011
Optimization of network protection against virus spread.
Proceedings of the 8th International Workshop on the Design of Reliable Communication Networks, 2011
2010
A Mixed Integer Model for the Sparsest Cut problem.
Electron. Notes Discret. Math., 2010
Combinatorial auctions for exchanging resources over a grid network.
Ann. des Télécommunications, 2010
On maximizing collaboration in Wireless Mesh Networks without monetary incentives.
Proceedings of the 8th International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks (WiOpt 2010), May 31, 2010
A Combinatorial Exchange for Complex Grid Services.
Proceedings of the Economic Models and Algorithms for Distributed Systems, 2010
Optimization of OSPF Routing in IP Networks.
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010
2008
Multi-period capacitated location with modular equipments.
Comput. Oper. Res., 2008
Max-min fair survivable networks.
Ann. des Télécommunications, 2008
2007
Biclique completion problems for multicast network design.
Discret. Optim., 2007
2006
Computing optimal max-min fair resource allocation for elastic flows.
IEEE/ACM Trans. Netw., 2006
Design of survivable IP-over-optical networks.
Ann. Oper. Res., 2006
2005
Demonstration with field trails of a satellite-terrestrial synergistic approach for digital multimedia broadcasting to mobile users.
,
,
,
,
,
,
,
,
,
,
,
,
,
IEEE Wirel. Commun., 2005
A branch and cut algorithm for hub location problems with single assignment.
Math. Program., 2005
2003
Internet Routing and Related Topology Issues.
SIAM J. Discret. Math., 2003
2000
The Uncapacitated Facility Location Problem with Client Matching.
Oper. Res., 2000
1996
Global optimization of Hölder functions.
J. Glob. Optim., 1996
1994
Global Optimization Decomposition Methods for Bounded Parameter Minimax Risk Evaluation.
SIAM J. Sci. Comput., 1994
Finding maximum likelihood estimators for the three-parameter Weibull distribution.
J. Glob. Optim., 1994