Walid Ben-Ameur

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 36

Top Topics

Subset Selection

Branch And Bound Algorithm

Top Venues

Discret. Appl. Math.

J. Comb. Optim.

Eur. J. Oper. Res.

Publications

Walid Ben-Ameur, Natalia Kushik, Alessandro Maddaloni, José Neto, Dimitri Watel
The no-meet matroid. Discret. Appl. Math. 354 (2024)
Walid Ben-Ameur
Matrices. SIAM J. Optim. 34 (1) (2024)
Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman, Albert Sunny, Sudheer Poojary
A game theoretic framework for distributed computing with dynamic set of agents. Ann. Oper. Res. 336 (3) (2024)
Yacine Al-Najjar, Walid Ben-Ameur, Jérémie Leguay, Jocelyne Elias
Affine routing for robust network design. Networks 79 (4) (2022)
Walid Ben-Ameur, José Neto
New bounds for subset selection from conic relaxations. Eur. J. Oper. Res. 298 (2) (2022)
Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman, Albert Sunny, Sudheer Poojary
Strategic investments in distributed computing: A stochastic game perspective. J. Parallel Distributed Comput. 169 (2022)
Yacine Al-Najjar, Walid Ben-Ameur, Jérémie Leguay
Approximability of Robust Network Design: The Directed Case. STACS (2022)
Walid Ben-Ameur, Lorela Cano, Tijani Chahed
A framework for joint admission control, resource allocation and pricing for network slicing in 5G. GLOBECOM (2021)
Yacine Al-Najjar, Walid Ben-Ameur, Jérémie Leguay
On the approximability of robust network design. Theor. Comput. Sci. 860 (2021)
Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman
A two phase investment game for competitive opinion dynamics in social networks. Inf. Process. Manag. 57 (2) (2020)
Yacine Al-Najjar, Walid Ben-Ameur, Jeremie Leguay
On the Approximability of Robust Network Design. CoRR (2020)
Guanglei Wang, Walid Ben-Ameur, Adam Ouorou
A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines. Eur. J. Oper. Res. 276 (1) (2019)
José Neto, Walid Ben-Ameur
On fractional cut covers. Discret. Appl. Math. 265 (2019)
Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman
Optimal Investment Strategies for Competing Camps in a Social Network: A Broad Framework. IEEE Trans. Netw. Sci. Eng. 6 (4) (2019)
Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman
A Two Phase Investment Game for Competitive Opinion Dynamics in Social Networks. CoRR (2018)
Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman
Optimal Multiphase Investment Strategies for Influencing Opinions in a Social Network. AAMAS (2018)
Walid Ben-Ameur, Mohamed Didi Biha
A note on the problem of r disjoint (s, t)-cuts and some related issues. Oper. Res. Lett. 46 (3) (2018)
Walid Ben-Ameur, Antoine Glorieux, José Neto
Complete formulations of polytopes related to extensions of assignment matrices. Discret. Optim. 29 (2018)
Swapnil Dhamal, Tijani Chahed, Walid Ben-Ameur, Eitan Altman, Albert Sunny, Sudheer Poojary
A Stochastic Game Framework for Analyzing Computational Investment Strategies in Distributed Computing with Application to Blockchain Mining. CoRR (2018)
Walid Ben-Ameur, Adam Ouorou, Guanglei Wang, Mateusz Zotkiewicz
Multipolar robust optimization. EURO J. Comput. Optim. 6 (4) (2018)
Vincent Angilella, Matthieu Chardy, Walid Ben-Ameur
Fiber Cable Network Design with Operations Administration & Maintenance Constraints. ICORES (2018)
Vincent Angilella, Walid Ben-Ameur, Matthieu Chardy
Design of fiber cable tree FTTH networks. Electron. Notes Discret. Math. 64 (2018)
Walid Ben-Ameur, Antoine Glorieux, José Neto
On the most imbalanced orientation of a graph. J. Comb. Optim. 36 (2) (2018)
Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman
Optimal Multiphase Investment Strategies for Influencing Opinions in a Social Network. CoRR (2018)
Vincent Angilella, Matthieu Chardy, Walid Ben-Ameur
Fiber cable network design in tree networks. Eur. J. Oper. Res. 269 (3) (2018)
Vincent Angilella, Matthieu Chardy, Walid Ben-Ameur
Operations Administration and Maintenance Constraints in Fiber Cables Network Design. ICORES (Selected Papers) (2018)
Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman
Resource Allocation Polytope Games: Uniqueness of Equilibrium, Price of Stability, and Price of Anarchy. AAAI (2018)
Walid Ben-Ameur, Adam Ouorou, Guanglei Wang
Convex and concave envelopes: Revisited and new perspectives. Oper. Res. Lett. 45 (5) (2017)
Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman
Good versus Evil: A Framework for Optimal Investment Strategies for Competing Camps in a Social Network. CoRR (2017)
Walid Ben-Ameur, Antoine Glorieux, José Neto
From Graph Orientation to the Unweighted Maximum Cut. COCOON (2016)
Abdallah Sobehy, Walid Ben-Ameur, Hossam Afifi, Amira Bradai
How to Win Elections. CollaborateCom (2016)
Guanglei Wang, Walid Ben-Ameur, José Neto, Adam Ouorou
Optimal Mapping of Cloud Virtual Machines. Electron. Notes Discret. Math. 52 (2016)
Walid Ben-Ameur, Pascal Bianchi, Jérémie Jakubowicz
Robust Distributed Consensus Using Total Variation. IEEE Trans. Autom. Control. 61 (6) (2016)
Walid Ben-Ameur, Antoine Glorieux, José Neto
A Full Description of Polytopes Related to the Index of the Lowest Nonzero Row of an Assignment Matrix. ISCO (2016)
Vincent Angilella, Matthieu Chardy, Walid Ben-Ameur
Cables network design optimization for the Fiber To The Home. DRCN (2016)
Walid Ben-Ameur, Mohamed Didi Biha
Extended cuts. J. Comb. Optim. 31 (3) (2016)
Zeineb Hraiech, Fatma Abdelkefi, Mohamed Siala, Walid Ben-Ameur
Characterization of Ping-Pong Optimized Pulse Shaping-OFDM (POPS-OFDM) for 5G Systems. VTC Spring (2015)
Walid Ben-Ameur, Mohamed-Ahmed Mohamed-Sidi, José Neto
The $$k$$ k -separator problem: polyhedra, complexity and approximation results. J. Comb. Optim. 29 (1) (2015)
Pierre-Olivier Bauguion, Walid Ben-Ameur, Éric Gourdin
Efficient algorithms for the maximum concurrent flow problem. Networks 65 (1) (2015)
Walid Ben-Ameur, Antoine Glorieux, José Neto
On the Most Imbalanced Orientation of a Graph. COCOON (2015)
Wassef Louati, Walid Ben-Ameur, Djamal Zeghlache
A bottleneck-free tree-based name resolution system for Information-Centric Networking. Comput. Networks 91 (2015)
Mohamad Assaad, Walid Ben-Ameur, Faiz Hamid
Resource Optimization of Non-Additive Utility Functions in Localized SC-FDMA Systems. IEEE Trans. Signal Process. 62 (18) (2014)
Walid Ben-Ameur, Michal Pióro, Mateusz Zotkiewicz
Fractional routing using pairs of failure-disjoint paths. Discret. Appl. Math. 164 (2014)
Walid Ben-Ameur, Pascal Bianchi, Jérémie Jakubowicz
A Total Variation based approach for robust consensus in distributed networks. CDC (2013)
Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou
Minimum-weight subgraphs with unicyclic components and a lower-bounded girth. Networks 61 (4) (2013)
Mohamad Assaad, Walid Ben-Ameur, Faiz Hamid
An Interval Assignment Problem for Resource Optimization in LTE Networks. Electron. Notes Discret. Math. 41 (2013)
Ahmed Soua, Walid Ben-Ameur, Hossam Afifi
Beamforming-based broadcast scheme for multihop wireless networks with transmission range adjustment. WONS (2013)
Walid Ben-Ameur, Mateusz Zotkiewicz
Multipolar routing: where dynamic and static routing meet. Electron. Notes Discret. Math. 41 (2013)
Pierre-Olivier Bauguion, Walid Ben-Ameur, Éric Gourdin
A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source Maximum Concurrent Flow. Electron. Notes Discret. Math. 41 (2013)
Walid Ben-Ameur, Mohamed-Ahmed Mohamed-Sidi, José Neto
-Separator Problem. COCOON (2013)
Amira Bradai, Walid Ben-Ameur, Hossam Afifi
Byzantine resistant reputation-based trust management. CollaborateCom (2013)
Mateusz Zotkiewicz, Walid Ben-Ameur
Volume-oriented routing and its modifications. Telecommun. Syst. 52 (2) (2013)
Ahmed Soua, Walid Ben-Ameur, Hossam Afifi
Broadcast-based directional routing in vehicular ad-hoc networks. WMNC (2012)
Walid Ben-Ameur, José Neto
A gradient-based randomised heuristic for the maximum cut problem. Int. J. Math. Oper. Res. 4 (3) (2012)
Ahmed Soua, Walid Ben-Ameur, Hossam Afifi
Broadcast-based Directional Routing in Vehicular Ad-Hoc Networks CoRR (2012)
Walid Ben-Ameur, Pascal Bianchi, Jérémie Jakubowicz
Robust average consensus using Total Variation Gossip Algorithm. VALUETOOLS (2012)
Walid Ben-Ameur, Mohamed Didi Biha
On the minimum cut separator problem. Networks 59 (1) (2012)
Ahmed Soua, Walid Ben-Ameur, Hossam Afifi
Enhancing broadcast vehicular communications using beamforming technique. WiMob (2012)
Ahmed Soua, Walid Ben-Ameur, Hossam Afifi
Analysis of information relay processing in inter-vehicle communication: A novel visit. WiMob (2012)
Ines Houidi, Wajdi Louati, Walid Ben-Ameur, Djamal Zeghlache
Virtual network provisioning across multiple substrate networks. Comput. Networks 55 (4) (2011)
Pierre-Olivier Bauguion, Walid Ben-Ameur, Éric Gourdin
Cache Location in Tree Networks: Preliminary Results. INOC (2011)
Walid Ben-Ameur, Mateusz Zotkiewicz
Robust routing and optimal partitioning of a traffic demand polytope. Int. Trans. Oper. Res. 18 (3) (2011)
Walid Ben-Ameur, José Neto
A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems. Discret. Appl. Math. 159 (16) (2011)
Walid Ben-Ameur, Mateusz Zotkiewicz
Polynomial traffic demand polytope partitioning. Electron. Notes Discret. Math. 36 (2010)
Walid Ben-Ameur, Makhlouf Hadji
Steiner Networks with unicyclic connected components. Electron. Notes Discret. Math. 36 (2010)
Walid Ben-Ameur, Pablo Pavón-Mariño, Michal Pióro
On Traffic Domination in Communication Networks. PERFORM (2010)
Mateusz Zotkiewicz, Walid Ben-Ameur, Michal Pióro
Finding Failure-Disjoint Paths for Path Diversity Protection in Communication Networks. IEEE Commun. Lett. 14 (8) (2010)
Walid Ben-Ameur, José Neto
Spectral bounds for unconstrained (-1, 1)-quadratic optimization problems. Eur. J. Oper. Res. 207 (1) (2010)
Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou
Networks with unicyclic connected components and without short cycles. Electron. Notes Discret. Math. 36 (2010)
Walid Ben-Ameur, Mohamed Didi Biha
Algorithms and formulations for the minimum cut separator problem. Electron. Notes Discret. Math. 36 (2010)
Mateusz Zotkiewicz, Walid Ben-Ameur, Michal Pióro
Failure disjoint paths. Electron. Notes Discret. Math. 36 (2010)
Walid Ben-Ameur, Makhlouf Hadji
Designing Steiner Networks with Unicyclic Connected Components: An Easy Problem. SIAM J. Discret. Math. 24 (4) (2010)
Mateusz Zotkiewicz, Walid Ben-Ameur
More Adaptive Robust Stable Routing. GLOBECOM (2009)
Walid Ben-Ameur, José Neto
A Polynomial-Time Recursive Algorithm for some Unconstrained Quadratic Optimization Problems. CTW (2009)
Mohamed Chedly Ghedira, Walid Ben-Ameur, Hossam Afifi
A Novel Route Guidance Algorithm with Maximum Coverage and Minimum Handover for Vehicular Networks. ICN (2008)
Walid Ben-Ameur, José Neto
Spectral bounds for the maximum cut problem. Networks 52 (1) (2008)
Walid Ben-Ameur, José Neto
A geometric characterization of "optimality-equivalent" relaxations. J. Glob. Optim. 42 (4) (2008)
Walid Ben-Ameur
Between fully dynamic routing and robust stable routing. DRCN (2007)
Meriema Belaidouni, Walid Ben-Ameur
On the minimum cost multiple-source unsplittable flow problem. RAIRO Oper. Res. 41 (3) (2007)
Walid Ben-Ameur, Luis Eduardo Neves Gouveia
Preface. Networks 50 (1) (2007)
Walid Ben-Ameur, José Neto
Acceleration of cutting-plane and column generation algorithms: Applications to network design. Networks 49 (1) (2007)
Walid Ben-Ameur, José Neto
A constraint generation algorithm for large scale linear programs using multiple-points separation. Math. Program. 107 (3) (2006)
Walid Ben-Ameur
New bounds for the maximum cut problem. Electron. Notes Discret. Math. 27 (2006)
Walid Ben-Ameur, Luis Eduardo Neves Gouveia
Further contributions to network optimization. Networks 48 (1) (2006)
Walid Ben-Ameur, Daniel Bienstock, Iraj Saniee
Foreword. Ann. Oper. Res. 146 (1) (2006)
Walid Ben-Ameur, Adam Ouorou
Mathematical Models of the Delay Constrained Routing Problem. Algorithmic Oper. Res. 1 (2) (2006)
Walid Ben-Ameur
On the Maximum Cut Problem. ACiD (2006)
Kaouthar Sethom, Hossam Afifi, Walid Ben-Ameur
M&M's: an MPLS micro-mobility solution. ISWCS (2004)
Walid Ben-Ameur, Luis Eduardo Neves Gouveia
Some recent contributions to network optimization. Networks 44 (1) (2004)
Walid Ben-Ameur
Computing the Initial Temperature of Simulated Annealing. Comput. Optim. Appl. 29 (3) (2004)
Walid Ben-Ameur, Hervé Kerivin
Networks new economical virtual private. Commun. ACM 46 (6) (2003)
Walid Ben-Ameur, Éric Gourdin
Internet Routing and Related Topology Issues. SIAM J. Discret. Math. 17 (1) (2003)
Walid Ben-Ameur
Multi-hour design of survivable classical IP networks. Int. J. Commun. Syst. 15 (6) (2002)
Walid Ben-Ameur, Bernard Liau
Calcul des métriques de routage pour Internet. Ann. des Télécommunications 56 (3-4) (2001)
Thi Tuyet Loan Pham, Walid Ben-Ameur
Design of Survivible Networks Based on End-to-End Rerouting. DRCN (2001)
Walid Ben-Ameur
Constrained length connectivity and survivable networks. Networks 36 (1) (2000)