Walid Ben-Ameur

SIAM J. Optim., March, 2024

2022

Affine routing for robust network design.

[BibT_eX]

[DOI]

Networks, 2022

Strategic investments in distributed computing: A stochastic game perspective.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2022

New bounds for subset selection from conic relaxations.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2022

Approximability of Robust Network Design: The Directed Case.

[BibT_eX]

[DOI]

Yacine Al-Najjar

Jérémie Leguay

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2021

On the approximability of robust network design.

[BibT_eX]

[DOI]

Yacine Al-Najjar

Jérémie Leguay

Theor. Comput. Sci., 2021

A framework for joint admission control, resource allocation and pricing for network slicing in 5G.

[BibT_eX]

[DOI]

Lorela Cano

Tijani Chahed

Proceedings of the IEEE Global Communications Conference, 2021

2020

A two phase investment game for competitive opinion dynamics in social networks.

[BibT_eX]

[DOI]

Inf. Process. Manag., 2020

2019

Optimal Investment Strategies for Competing Camps in a Social Network: A Broad Framework.

[BibT_eX]

[DOI]

IEEE Trans. Netw. Sci. Eng., 2019

A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines.

[BibT_eX]

[DOI]

Guanglei Wang

Eur. J. Oper. Res., 2019

On fractional cut covers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2018

A note on the problem of r disjoint (s, t)-cuts and some related issues.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2018

On the most imbalanced orientation of a graph.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

Fiber cable network design in tree networks.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2018

Design of fiber cable tree FTTH networks.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2018

Multipolar robust optimization.

[BibT_eX]

[DOI]

EURO J. Comput. Optim., 2018

Complete formulations of polytopes related to extensions of assignment matrices.

[BibT_eX]

[DOI]

Discret. Optim., 2018

A Stochastic Game Framework for Analyzing Computational Investment Strategies in Distributed Computing with Application to Blockchain Mining.

[BibT_eX]

[DOI]

CoRR, 2018

Operations Administration and Maintenance Constraints in Fiber Cables Network Design.

[BibT_eX]

[DOI]

Proceedings of the Operations Research and Enterprise Systems, 2018

Fiber Cable Network Design with Operations Administration & Maintenance Constraints.

[BibT_eX]

[DOI]

Proceedings of the 7th International Conference on Operations Research and Enterprise Systems, 2018

Optimal Multiphase Investment Strategies for Influencing Opinions in a Social Network.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Resource Allocation Polytope Games: Uniqueness of Equilibrium, Price of Stability, and Price of Anarchy.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Convex and concave envelopes: Revisited and new perspectives.

[BibT_eX]

[DOI]

Guanglei Wang

Oper. Res. Lett., 2017

Good versus Evil: A Framework for Optimal Investment Strategies for Competing Camps in a Social Network.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Robust Distributed Consensus Using Total Variation.

[BibT_eX]

[DOI]

Pascal Bianchi

Jérémie Jakubowicz

IEEE Trans. Autom. Control., 2016

Extended cuts.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

Optimal Mapping of Cloud Virtual Machines.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

A Full Description of Polytopes Related to the Index of the Lowest Nonzero Row of an Assignment Matrix.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

Cables network design optimization for the Fiber To The Home.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on the Design of Reliable Communication Networks, 2016

How to Win Elections.

[BibT_eX]

[DOI]

Proceedings of the Collaborate Computing: Networking, Applications and Worksharing, 2016

From Graph Orientation to the Unweighted Maximum Cut.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

Efficient algorithms for the maximum concurrent flow problem.

[BibT_eX]

[DOI]

Pierre-Olivier Bauguion

Networks, 2015

The $$k$$ k -separator problem: polyhedra, complexity and approximation results.

[BibT_eX]

[DOI]

Mohamed-Ahmed Mohamed-Sidi

J. Comb. Optim., 2015

A bottleneck-free tree-based name resolution system for Information-Centric Networking.

[BibT_eX]

[DOI]

Wassef Louati

Djamal Zeghlache

Comput. Networks, 2015

Characterization of Ping-Pong Optimized Pulse Shaping-OFDM (POPS-OFDM) for 5G Systems.

[BibT_eX]

[DOI]

Proceedings of the IEEE 81st Vehicular Technology Conference, 2015

2014

Resource Optimization of Non-Additive Utility Functions in Localized SC-FDMA Systems.

[BibT_eX]

[DOI]

Mohamad Assaad

Faiz Hamid

IEEE Trans. Signal Process., 2014

Fractional routing using pairs of failure-disjoint paths.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

Volume-oriented routing and its modifications.

[BibT_eX]

[DOI]

Telecommun. Syst., 2013

Minimum-weight subgraphs with unicyclic components and a lower-bounded girth.

[BibT_eX]

[DOI]

Networks, 2013

Multipolar routing: where dynamic and static routing meet.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source Maximum Concurrent Flow.

[BibT_eX]

[DOI]

Pierre-Olivier Bauguion

Electron. Notes Discret. Math., 2013

An Interval Assignment Problem for Resource Optimization in LTE Networks.

[BibT_eX]

[DOI]

Mohamad Assaad

Faiz Hamid

Electron. Notes Discret. Math., 2013

Beamforming-based broadcast scheme for multihop wireless networks with transmission range adjustment.

[BibT_eX]

[DOI]

Proceedings of the 10th Annual Conference on Wireless On-demand Network Systems and Services, 2013

Byzantine resistant reputation-based trust management.

[BibT_eX]

[DOI]

Amira Bradai

Proceedings of the 9th IEEE International Conference on Collaborative Computing: Networking, 2013

The <i>k</i>-Separator Problem.

[BibT_eX]

[DOI]

Mohamed-Ahmed Mohamed-Sidi

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

A Total Variation based approach for robust consensus in distributed networks.

[BibT_eX]

[DOI]

Pascal Bianchi

Jérémie Jakubowicz

Proceedings of the 52nd IEEE Conference on Decision and Control, 2013

2012

On the minimum cut separator problem.

[BibT_eX]

[DOI]

Networks, 2012

A gradient-based randomised heuristic for the maximum cut problem.

[BibT_eX]

[DOI]

Int. J. Math. Oper. Res., 2012

Enhancing broadcast vehicular communications using beamforming technique.

[BibT_eX]

[DOI]

Proceedings of the 8th IEEE International Conference on Wireless and Mobile Computing, 2012

Analysis of information relay processing in inter-vehicle communication: A novel visit.

[BibT_eX]

[DOI]

Proceedings of the 8th IEEE International Conference on Wireless and Mobile Computing, 2012

Robust average consensus using Total Variation Gossip Algorithm.

[BibT_eX]

[DOI]

Pascal Bianchi

Jérémie Jakubowicz

Proceedings of the 6th International ICST Conference on Performance Evaluation Methodologies and Tools, 2012

Broadcast-based directional routing in vehicular ad-hoc networks.

[BibT_eX]

[DOI]

Proceedings of the 5th Joint IFIP Wireless and Mobile Networking Conference, 2012

2011

Robust routing and optimal partitioning of a traffic demand polytope.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2011

A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Virtual network provisioning across multiple substrate networks.

[BibT_eX]

[DOI]

Comput. Networks, 2011

Cache Location in Tree Networks: Preliminary Results.

[BibT_eX]

[DOI]

Pierre-Olivier Bauguion

Proceedings of the Network Optimization - 5th International Conference, 2011

2010

Designing Steiner Networks with Unicyclic Connected Components: An Easy Problem.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Finding Failure-Disjoint Paths for Path Diversity Protection in Communication Networks.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2010

Spectral bounds for unconstrained (-1, 1)-quadratic optimization problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2010

Failure disjoint paths.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

Polynomial traffic demand polytope partitioning.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

Networks with unicyclic connected components and without short cycles.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

Steiner Networks with unicyclic connected components.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

Algorithms and formulations for the minimum cut separator problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

On Traffic Domination in Communication Networks.

[BibT_eX]

[DOI]

Pablo Pavón-Mariño

Proceedings of the Performance Evaluation of Computer and Communication Systems. Milestones and Future Challenges, 2010

2009

More Adaptive Robust Stable Routing.

[BibT_eX]

[DOI]

Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009

2008

Spectral bounds for the maximum cut problem.

[BibT_eX]

[DOI]

Networks, 2008

A geometric characterization of "optimality-equivalent" relaxations.

[BibT_eX]

[DOI]

J. Glob. Optim., 2008

A Novel Route Guidance Algorithm with Maximum Coverage and Minimum Handover for Vehicular Networks.

[BibT_eX]

[DOI]

Mohamed Chedly Ghedira

Proceedings of the Seventh International Conference on Networking (ICN 2008), 2008

2007

On the minimum cost multiple-source unsplittable flow problem.

[BibT_eX]

[DOI]

Meriema Belaidouni

RAIRO Oper. Res., 2007

Acceleration of cutting-plane and column generation algorithms: Applications to network design.

[BibT_eX]

[DOI]

Networks, 2007

Preface.

[BibT_eX]

[DOI]

Luis Eduardo Neves Gouveia

Networks, 2007

Between fully dynamic routing and robust stable routing.

[BibT_eX]

[DOI]

Proceedings of the 6th International Workshop on Design and Reliable Communication Networks, 2007

2006

Further contributions to network optimization.

[BibT_eX]

[DOI]

Luis Eduardo Neves Gouveia

Networks, 2006

A constraint generation algorithm for large scale linear programs using multiple-points separation.

[BibT_eX]

[DOI]

Math. Program., 2006

New bounds for the maximum cut problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

Mathematical Models of the Delay Constrained Routing Problem.

[BibT_eX]

[DOI]

Algorithmic Oper. Res., 2006

Foreword.

[BibT_eX]

[DOI]

Daniel Bienstock

Iraj Saniee

Ann. Oper. Res., 2006

On the Maximum Cut Problem.

[BibT_eX]

Proceedings of the Algorithms and Complexity in Durham 2006, 2006

2004

Some recent contributions to network optimization.

[BibT_eX]

[DOI]

Luis Eduardo Neves Gouveia

Networks, 2004

Computing the Initial Temperature of Simulated Annealing.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2004

M&M's: an MPLS micro-mobility solution.

[BibT_eX]

[DOI]

Kaouthar Sethom

Proceedings of the 1st IEEE International Symposium on Wireless Communication Systems, 2004

2003

Internet Routing and Related Topology Issues.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2003

Networks new economical virtual private.

[BibT_eX]

[DOI]

Hervé Kerivin

Commun. ACM, 2003

2002

Multi-hour design of survivable classical IP networks.

[BibT_eX]

[DOI]

Int. J. Commun. Syst., 2002

2001

Calcul des métriques de routage pour Internet.

[BibT_eX]

[DOI]

Bernard Liau

Ann. des Télécommunications, 2001

Design of Survivible Networks Based on End-to-End Rerouting.

[BibT_eX]

Thi Tuyet Loan Pham

Proceedings of the 3rd International Workshop on the Design of Reliable Communication Networks, 2001

2000

Constrained length connectivity and survivable networks.

[BibT_eX]

[DOI]