Walid Ben-Ameur: Subset Selection and the Cone of Factor-Width-k Matrices. SIAM J. Optim. 34(1): 817-843 (2024)
Walid Ben-Ameur. Proximity guarantees of a lift-and-project approach for the cardinality-constrained Boolean quadric polytope. Operations Research Letters, 57, pp.107166 (2024). ⟨hal-04680844⟩
Walid Ben-Ameur, Alessandro Maddaloni. A cops and robber game and the meeting time of synchronous directed walks. Networks 84(2): 238-251 (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): 1871-1904 (2024)
Walid Ben-Ameur, Natalia Kushik, Alessandro Maddaloni, José Neto, Dimitri Watel: The no-meet matroid. Discret. Appl. Math. 354: 94-107 (2024)
Walid Ben-Ameur, José Neto: New bounds for subset selection from conic relaxations. Eur. J. Oper. Res. 298(2): 425-438 (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: 317-333 (2022)
Yacine Al-Najjar, Walid Ben-Ameur, Jérémie Leguay, Jocelyne Elias: Affine routing for robust network design. Networks 79(4): 557-579 (2022)
Yacine Al-Najjar, Walid Ben-Ameur, Jérémie Leguay: On the approximability of robust network design. Theor. Comput. Sci. 860: 41-50 (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): 102064 (2020)
José Neto, Walid Ben-Ameur: On fractional cut covers. Discret. Appl. Math. 265: 168-181 (2019)
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): 28-39 (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): 628-645 (2019)
Walid Ben-Ameur, Antoine Glorieux, José Neto: Complete formulations of polytopes related to extensions of assignment matrices. Discret. Optim. 29: 133-147 (2018)
Walid Ben-Ameur, Adam Ouorou, Guanglei Wang, Mateusz Zotkiewicz: Multipolar robust optimization. EURO J. Comput. Optim. 6(4): 395-434 (2018)
Vincent Angilella, Walid Ben-Ameur, Matthieu Chardy: Design of fiber cable tree FTTH networks. Electron. Notes Discret. Math. 64: 235-244 (2018)
Vincent Angilella, Matthieu Chardy, Walid Ben-Ameur: Fiber cable network design in tree networks. Eur. J. Oper. Res. 269(3): 1086-1106 (2018)
Walid Ben-Ameur, Antoine Glorieux, José Neto: On the most imbalanced orientation of a graph. J. Comb. Optim. 36(2): 637-669 (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): 335-338 (2018)
Walid Ben-Ameur, Adam Ouorou, Guanglei Wang: Convex and concave envelopes: Revisited and new perspectives. Oper. Res. Lett. 45(5): 421-426 (2017)
Guanglei Wang, Walid Ben-Ameur, José Neto, Adam Ouorou: Optimal Mapping of Cloud Virtual Machines. Electron. Notes Discret. Math. 52: 93-100 (2016)
Walid Ben-Ameur, Mohamed Didi Biha: Extended cuts. J. Comb. Optim. 31(3): 1034-1044 (2016)
Walid Ben-Ameur, Pascal Bianchi, Jérémie Jakubowicz: Robust Distributed Consensus Using Total Variation. IEEE Trans. Autom. Control. 61(6): 1550-1564 (2016)
Wassef Louati, Walid Ben-Ameur, Djamal Zeghlache: A bottleneck-free tree-based name resolution system for Information-Centric Networking. Comput. Networks 91: 341-355 (2015)
Walid Ben-Ameur, Mohamed-Ahmed Mohamed-Sidi, José Neto: The k-separator problem: polyhedra, complexity and approximation results. J. Comb. Optim. 29(1): 276-307 (2015)
Pierre-Olivier Bauguion, Walid Ben-Ameur, Éric Gourdin: Efficient algorithms for the maximum concurrent flow problem. Networks 65(1): 56-67 (2015)
Walid Ben-Ameur, Michal Pióro, Mateusz Zotkiewicz: Fractional routing using pairs of failure-disjoint paths. Discret. Appl. Math. 164: 47-60 (2014)
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): 4896-4910 (2014)
Walid Ben-Ameur, Mateusz Zotkiewicz: Multipolar routing: where dynamic and static routing meet. Electron. Notes Discret. Math. 41: 61-68 (2013)
Mohamad Assaad, Walid Ben-Ameur, Faiz Hamid: An Interval Assignment Problem for Resource Optimization in LTE Networks. Electron. Notes Discret. Math. 41: 237-244 (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: 311-318 (2013)
Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou: Minimum-weight subgraphs with unicyclic components and a lower-bounded girth. Networks 61(4): 335-355 (2013)
Mateusz Zotkiewicz, Walid Ben-Ameur: Volume-oriented routing and its modifications. Telecommun. Syst. 52(2): 935-945 (2013)
Walid Ben-Ameur, José Neto: A gradient-based randomised heuristic for the maximum cut problem. Int. J. Math. Oper. Res. 4(3): 276-293 (2012)
Walid Ben-Ameur, Mohamed Didi Biha: On the minimum cut separator problem. Networks 59(1): 30-36 (2012)
Ines Houidi, Wajdi Louati, Walid Ben-Ameur, Djamal Zeghlache: Virtual network provisioning across multiple substrate networks. Comput. Networks 55(4): 1011-1023 (2011)
Walid Ben-Ameur, José Neto: A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems. Discret. Appl. Math. 159(16): 1689-1698 (2011)
Walid Ben-Ameur, Mateusz Zotkiewicz: Robust routing and optimal partitioning of a traffic demand polytope. Int. Trans. Oper. Res. 18(3): 307-333 (2011)
Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou: Networks with unicyclic connected components and without short cycles. Electron. Notes Discret. Math. 36: 961-968 (2010)
Walid Ben-Ameur, Makhlouf Hadji: Steiner Networks with unicyclic connected components. Electron. Notes Discret. Math. 36: 969-976 (2010)
Walid Ben-Ameur, Mohamed Didi Biha: Algorithms and formulations for the minimum cut separator problem. Electron. Notes Discret. Math. 36: 977-983 (2010)
Mateusz Zotkiewicz, Walid Ben-Ameur, Michal Pióro: Failure disjoint paths. Electron. Notes Discret. Math. 36: 1105-1112 (2010)
Walid Ben-Ameur, Mateusz Zotkiewicz: Polynomial traffic demand polytope partitioning. Electron. Notes Discret. Math. 36: 1113-1120 (2010)
Walid Ben-Ameur, José Neto: Spectral bounds for unconstrained (-1, 1)-quadratic optimization problems. Eur. J. Oper. Res. 207(1): 15-24 (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): 776-778 (2010)
Walid Ben-Ameur, Makhlouf Hadji: Designing Steiner Networks with Unicyclic Connected Components: An Easy Problem. SIAM J. Discret. Math. 24(4): 1541-1557 (2010)
Walid Ben-Ameur, José Neto: A geometric characterization of "optimality-equivalent" relaxations. J. Glob. Optim. 42(4): 533-547 (2008)
Walid Ben-Ameur, José Neto: Spectral bounds for the maximum cut problem. Networks 52(1): 8-13 (2008)
Walid Ben-Ameur, José Neto: Acceleration of cutting-plane and column generation algorithms: Applications to network design. Networks 49(1): 3-17 (2007)
Meriema Belaidouni, Walid Ben-Ameur: On the minimum cost multiple-source unsplittable flow problem. RAIRO Oper. Res. 41(3): 253-273 (2007)
Walid Ben-Ameur, Adam Ouorou: Mathematical Models of the Delay Constrained Routing Problem. Algorithmic Oper. Res. 1(2) (2006)
Walid Ben-Ameur: New bounds for the maximum cut problem. Electron. Notes Discret. Math. 27: 5 (2006)
Walid Ben-Ameur, José Neto: A constraint generation algorithm for large scale linear programs using multiple-points separation. Math. Program. 107(3): 517-537 (2006)
Walid Ben-Ameur, Plus de mathématiques pour gagner plus au "maillon faible". Math. & Sci. hum. ~ Mathematics and Social Sciences 173 (1), 27-41 (2006)
Walid Ben-Ameur, Hervé Kerivin: Routing of uncertain traffic demands. Optimization and Engineering 6, 283-313 (2005)
Walid Ben-Ameur: Computing the Initial Temperature of Simulated Annealing. Comput. Optim. Appl. 29(3): 369-385 (2004)
Walid Ben-Ameur, Hervé Kerivin: Networks new economical virtual private. Commun. ACM 46(6): 69-73 (2003)
Walid Ben-Ameur, Éric Gourdin: Internet Routing and Related Topology Issues. SIAM J. Discret. Math. 17(1): 18-49 (2003)
Walid Ben-Ameur: Multi-hour design of survivable classical IP networks. Int. J. Commun. Syst. 15(6): 553-572 (2002)
Walid Ben-Ameur, Bernard Liau: Calcul des métriques de routage pour Internet. Ann. des Télécommunications 56(3-4): 150-168 (2001)
Walid Ben-Ameur: Constrained length connectivity and survivable networks. Networks 36(1): 17-33 (2000)
Yacine Al-Najjar, Walid Ben-Ameur, Jérémie Leguay: Approximability of Robust Network Design: The Directed Case. STACS 2022: 6:1-6:16
Walid Ben-Ameur, Lorela Cano, Tijani Chahed: A framework for joint admission control, resource allocation and pricing for network slicing in 5G. GLOBECOM 2021: 1-6
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: 997-1006
Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed, Eitan Altman: Optimal Multiphase Investment Strategies for Influencing Opinions in a Social Network. AAMAS 2018: 1927-1929
Vincent Angilella, Matthieu Chardy, Walid Ben-Ameur: Operations Administration and Maintenance Constraints in Fiber Cables Network Design. ICORES (Selected Papers) 2018: 54-79
Vincent Angilella, Matthieu Chardy, Walid Ben-Ameur: Fiber Cable Network Design with Operations Administration & Maintenance Constraints. ICORES 2018: 94-105
Walid Ben-Ameur, Antoine Glorieux, José Neto: From Graph Orientation to the Unweighted Maximum Cut. COCOON 2016: 370-384
Abdallah Sobehy, Walid Ben-Ameur, Hossam Afifi, Amira Bradai: How to Win Elections. CollaborateCom 2016: 221-230
Vincent Angilella, Matthieu Chardy, Walid Ben-Ameur: Cables network design optimization for the Fiber To The Home. DRCN 2016: 87-94
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: 13-25
Walid Ben-Ameur, Antoine Glorieux, José Neto: On the Most Imbalanced Orientation of a Graph. COCOON 2015: 16-29
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: 1-6
Walid Ben-Ameur, Pascal Bianchi, Jérémie Jakubowicz: A Total Variation based approach for robust consensus in distributed networks. CDC 2013: 1690-1695
Walid Ben-Ameur, Mohamed-Ahmed Mohamed-Sidi, José Neto: The k-Separator Problem. COCOON 2013: 337-348
Amira Bradai, Walid Ben-Ameur, Hossam Afifi: Byzantine resistant reputation-based trust management. CollaborateCom 2013: 269-278
Ahmed Soua, Walid Ben-Ameur, Hossam Afifi: Beamforming-based broadcast scheme for multihop wireless networks with transmission range adjustment. WONS 2013: 107-109
Ahmed Soua, Walid Ben-Ameur, Hossam Afifi: Broadcast-based directional routing in vehicular ad-hoc networks. WMNC 2012: 48-53
Walid Ben-Ameur, Pascal Bianchi, Jérémie Jakubowicz: Robust average consensus using Total Variation Gossip Algorithm. VALUETOOLS 2012: 99-106
Ahmed Soua, Walid Ben-Ameur, Hossam Afifi: Analysis of information relay processing in inter-vehicle communication: A novel visit. WiMob 2012: 157-164
Ahmed Soua, Walid Ben-Ameur, Hossam Afifi: Enhancing broadcast vehicular communications using beamforming technique. WiMob 2012: 557-562
Pierre-Olivier Bauguion, Walid Ben-Ameur, Éric Gourdin: Cache Location in Tree Networks: Preliminary Results. INOC 2011: 517-522
Walid Ben-Ameur, Pablo Pavón-Mariño, Michal Pióro: On Traffic Domination in Communication Networks. PERFORM 2010: 191-202
Walid Ben-Ameur, José Neto: A Polynomial-Time Recursive Algorithm for some Unconstrained Quadratic Optimization Problems. CTW 2009: 105-108
Mateusz Zotkiewicz, Walid Ben-Ameur: More Adaptive Robust Stable Routing. GLOBECOM 2009: 1-6
Mohamed Chedly Ghedira, Walid Ben-Ameur, Hossam Afifi: A Novel Route Guidance Algorithm with Maximum Coverage and Minimum Handover for Vehicular Networks. ICN 2008: 692-697
Walid Ben-Ameur: Between fully dynamic routing and robust stable routing. DRCN 2007: 1-6
Walid Ben-Ameur: On the Maximum Cut Problem. ACiD 2006: 154
Kaouthar Sethom, Hossam Afifi, Walid Ben-Ameur: M&M's: an MPLS micro-mobility solution. ISWCS 2004: 334-337
Thi Tuyet Loan Pham, Walid Ben-Ameur: Design of Survivible Networks Based on End-to-End Rerouting. DRCN 2001: 258-265