photo


Pr. Walid Ben-Ameur
Institut TELECOM, TELECOM SudParis, UMR CNRS 5157
9 rue Charles Fourier, 91011 Evry, France

walid.benameur@it-sudparis.eu

 

 


Education

·         May 2007                : Habilitation à diriger les recherches (Graphs, flows and mathematical programming) - "Université Pierre et Marie Curie, Paris"

·         February 2000      : Ph.D in Computer Science from the "Ecole Nationale Supérieure des Télécommunications - Paris" with best honors

·         September 1996   : Master of Science in Telecommunication Systems from the "Ecole Nationale Supérieure des     Télécommunications - Paris" and the "Université Pierre et Marie Curie" with best honors

·         July 1996             : Engineering degree from the "Ecole Nationale Supérieure des Télécommunications - Paris"

·         Sept 91-July 93    : Two years of intensive mathematics courses


Experience

·         June 1999-September 2001: Researcher at France Telecom R&D

·         October 2001-November 2007: Associate professor at the Institut National des Télécommunications, France

·         December 2007 till now: Full professor at the Institut TELECOM, TELECOM SudParis, France (Head of the CNRS team “Methods”)

Research Interests

·         Graph Theory

·         Mathemtical Programming

·         Combinatorial optimization

·         Network Optimization

 

Teaching

·         Graph algorithms

·         Optimization

·         Network optimization

 

Honors

·         2008 : Glover-Klingman Prize (best paper published in Networks in 2007) – with José Neto

·         2006 : First Robert Faure prize (National French operation research prize attributed each 3 years to a scientist under 35 years old)  

·         1991 : Third prize in the International Mathematical Olympiad (Sweden)

·         1990 : Seventh prize in the National Tunisian physics competition

 
Publications

Journals (published/accepted):

 

·        W. Ben-Ameur and M. Didi-biha: On the minimum cut separator problem, Networks, 59 (1), pages 30-36, 2012

·        W. Ben-Ameur, M. Hadji and A. Ouorou: On minimum-weight subgraphs with unicyclic components and a lower-bounded girth, Networks, to appear

·        M. Zotkiewicz, W. Ben-Ameur: Volume-oriented routing and its modifications, Telecommunication Systems, 2012, DOI 10.1007/s11235-011-9602-5

·        W. Ben-Ameur and J. Neto : On a gradient-based randomized heuristic for the maximum cut problem, International journal of Mathematics in Operational Research, 4 (3), pages 276 – 293, 2012

·        W. Ben-Ameur, M. Pioro, M. Zotkiewicz: Fractional routing using pairs of failure-disjoint paths, Discrete Applied Mathematics, to appear

·        W. Ben-Ameur and J. Neto: A polynomial-time recursive algorithm for some unconstrained quadratic problems, Discrete Applied Mathematics, 159 (16), Pages1689-1698, 2011

·        W. Ben-Ameur and M. Zotkiewicz, Robust routing and optimal partitioning of a traffic demand polytope, International Transactions in Operational Research, 18 (3), pages 307-333, 2011

·        I. Houidi, W. Louati, W. Ben-Ameur and D. Zeghlache: Virtual Network Provisioning Across Multiple Substrate, Computer Networks, 55 (4), pages 1011-1023, 2011

·        W. Ben-Ameur, M. Hadji: Designing Steiner networks with unicyclic connected components: an easy problem, SIAM journal on discrete mathematics, 24 (4), pages 1541-1557, 2010

·        M. Zotkiewicz, W. Ben-Ameur, M. Pioro: Finding failure-disjoint paths for path diversity protection in communication networks, IEEE Communications Letters, 14, pages 776-778, 2010

·        W. Ben-Ameur and J. Neto: Spectral bounds for unconstrained (-1,1)-quadratic problems, European journal of operational research, 207, pages 15-24,2010

·        W. Ben-Ameur and J. Neto: Spectral bounds for the  maximum cut problem, Networks, 52, pages 8-13, 2008

·        W. Ben-Ameur and J. Neto: A geometric characterization of "optimality-equivalent" relaxations, Journal of Global Optimization, 42, pages 533-547, 2008

·        W. Ben-Ameur and M. Belaidouni; On the minimum cost multiple-source unsplittable flow problem, RAIRO-OR, 41, pages 253-273,  2007

·        W. Ben-Ameur and J. Neto: Acceleration of cutting planes and column generation algorithms: Application to network design;  Networks, Vol 49 (1), pages 3-17, 2007.

·        W. Ben-Ameur and J. Neto: A constraint generation algorithm for large scale linear programs using multiple-points separation, Mathematical Programming (series A), 107, pages 517-537, 2006

·        W. Ben-Ameur : plus de mathématiques pour gagner plus au maillon faible; Mathématiques et Sciences humaines,  173 (4), pages 5-18, 2006.

·        W. Ben-Ameur and L. Gouveia: Further contributions to network optimization; Vol 48, issue 1,  pages 1 -6, Networks, 2006

·        W. Ben-Ameur and A. Ouorou : Mathematical models of the delay constrained routing problem, Vol 1, issue 2, Algorithmic Operations Research, pages 94-103, 2006.

·        W. Ben-Ameur : Autour des algorithmes à plans coupants, Bulletin de La Roadef numéro 16, pages 11-14, 2006.

·        W. Ben-Ameur and H. Kerivin:  Routing of uncertain traffic demands; Optimization and Engineering, pages 283-313, (3),  2005

·        W. Ben-Ameur and L. Gouveia: Some recent contributions to network optimization; Networks, Vol 44, Issue 1, Pages 27-30, 2004

·        W. Ben-Ameur:  Computing the initial temperature of simulated annealing; Computational Optimization and Applications, 29, Pages 367-383, 2004

·        W. Ben-Ameur and E. Gourdin: Internet Routing and Related Topology Issues; SIAM J. Discrete Mathematics,  Volume 17, Number 1, Pages 18-49, 2003

·        W. Ben-Ameur and H. Kerivin:  New economical virtual private networks;  Communications of the ACM , Vol 46, pages 69--73, June  2003

·        W. Ben-Ameur: Multi-hour Design of Survivable Classical IP Networks; International Journal of Communication Systems, 15, pages 553-572, 2002

·        W. Ben-Ameur, B. Liau and N. Michel: Routing Strategies for IP Networks; Telektronikk Magazine, pages 145-158, 2/3 2001

·        W. Ben-Ameur and B. Liau: Computing Internet  routing metric (in french);  Annals of  Telecommunications – Tome 56, pages 150-168, Mars/April (2001)

·        W. Ben-Ameur: Constrained length connectivity and survivable networks; Networks, 36 (1): pages 17-33, August 2000

·         W. Ben-Ameur and D. Nace:   Methods, technics and rerouting strategies in  communication  networks (in french) ; Calculateurs Parallèles, Réseaux et Systèmes répartis, 11 (1): pages 9-35, HERMES  (June 99)

 

Journals (submitted):

 

·         W. Ben-Ameur and M. Didi-Biha: Extended cuts;  submitted

·         P. Bauguion, W. Ben-Ameur, E. Gourdin : An efficient tree-based model for multicommodity flow problems;  submitted

 

Book chapters and edited books:

·         W. Ben-Ameur, A. Ouorou, M. Zotkiewicz: Robust routing in communication networks, in mahjoub (Eds.), Progress in Combinatorial optimization, Iste, Wiley, pages 353-389,  (2012)

·         W. Ben-Ameur, A.R. Mahjoub, J. Neto: The maximum cut problem, in Paschos (Eds.), page 131-172, Paradigms of Combinatorial Optimisation, Wiley (2010)

·         W. Ben-Ameur, A.R. Mahjoub, J. Neto: Le problème de la coupe maximum, in Paschos (Eds.), Optimisation combinatoire, Hermès (2006)

·         W. Ben-Ameur, D. Bienstock, I. Saniee (Eds): New trends in network design,  Annals of operation research, vol 146, 2006

·         W. Ben-Ameur, L. Gouveia(Eds): Special issue of Networks,   Vol 50 (1) , 2007

·         W. Ben-Ameur, A. Petrowski (Eds): Proceeding of INOC'2003, ISSN: 1762-5734  

 

Patents:

·         W. Ben-Ameur et H. Kerivin: Brevet européen 03290830.3 "A method to determine the working parameters of a network to create, inside this network, a virtual private network taking into account the uncertain behavior of traffic"  

 

Conferences with proceedings (some papers):

·         W. Ben-Ameur and B. Liau:  Designing a reliable telecommunication network ; 2 nd workshop  on  ATM management (Montreal, september  97)

·         W. Ben-Ameur and B. Liau: Improvements of Benders method to design survivable networks  (in french) Proceedings of FRANCORO  (Sousse/Tunisia , April  98)

·         W. Ben-Ameur and E. Coelho-Alves: Planification of multi-modular Networks (in french);  Proceedings of FRANCORO  (Sousse/Tunisia, April 98)

·         W. Ben-Ameur,  E. Gourdin and B. Liau: Internet Routing and Topology Problems; in Proceeding of DRCN2000, pages 278-283, Munich, April 2000

·         W. Ben-Ameur, E. Gourdin, B. Liau and N. Michel:   Dimensioning of Internet Networks; in Proceeding of DRCN2000, pages 56-61, Munich, April 2000

·         W. Ben-Ameur, E. Gourdin, B. Liau and N. Michel:   Optimizing administrative weights for efficient single-path routing, in Proceeding of Networks 2000

·         W. Ben-Ameur and L. Pham:  Design of survivable networks based on end-to-end rerouting; In Proceeding of DRCN20001, Budapest 2001

·         W. Ben-Ameur, S. Besiktasliyan and B. Decocq:  Optimal dimensioning of a ring; in proceeding of ITC17,  Brazil 2001

·         W. Ben-Ameur,  E. Gourdin and N. Bourquia: Optimal routing for efficient Internet networks; in Proceeding of ECUMN2002,CREF, Colmar, France 2002

·         W. Ben-Ameur, H. Kim and H. Afifi: Toward Efficient Mobile Authentication in Wireless Inter-domain; in Proceeding of IEEE ASWN 2003, Berne, Switzerland

·         W. Ben-Ameur, M. Belaidouni: A Superadditive Approach to Solve the Minimum Cost Single Path Routing Problem: Preliminary Results; in Proceedings of INOC'2003, pages 67-71, Evry-Paris, France, 2003

·         W. Ben-Ameur, N. Bourquia and E. Gourdin: Optimal Shortest Path Routing for Internet Networks; in Proceedings of INOC'2003, pages 119-125, Evry-Paris, France, 2003

·         W. Ben-Ameur, H. Afifi and H. Kim: Analysis of Roaming  Architecture; in Proceedings of INOC'2003, pages 331-336, Evry-Paris, France, 2003

·         W. Ben-Ameur and J. Neto:  Separation multipoint, Proc. Roadef 2005, Edités par Billaut et Esswein, Presses universitaires Francois Rabelais, pages 29-43, 2005

·         W. Ben-Ameur : Des probabilités et de la programmation dynamique pour gagner au maillon faible, Proc. Roadef 2005.

·         W. Ben-Ameur: Computing the initial temperature of simulated annealing, in Proceedings of INOC'2005, pages 162-170, Lisbon, Portugal, 2005.

·         W. Ben-Ameur and J. Neto:  Multipoint separation, in Proceedings of INOC'2005, pages 492-499, Lisbon, Portugal, 2005.

·         W. Ben-Ameur and A. Ouorou : Routage avec contraintes de délai, LT'2006, Tunisia, 2006

·         W. Ben-Ameur and J. Neto:  Spectral Bounds for the maximum cut problem, in Proceedings of INOC'2007, Belgium

·         W. Ben-Ameur: Between fully dynamic routing and robust stable routing, Proceedings of DRCN’2007.

·         W. Ben-Ameur, M.C. Ghedira and H. Afifi: A Novel Route Guidance Algorithm with Maximum Coverage and Minimum Handover for Vehicular Networks, Seventh International Conference on Networking, pages 692-697, 2008.

·         W. Ben-Ameur, M. Hadji and A. Ouorou, Networks with unicyclic connected components, in Proc. INOC’2009, Pisa, Italy

·         W. Ben-Ameur, M. Didi-Biha, The cut separator problem, in Proc. INOC’2009, Pisa, Italy

·         W. Ben-Ameur, M. Zotkiewicz, Adding dynamism to robust stable routing, In proc of PTS 2009, Poland

·         Walid Ben-Ameur, J. Neto: A Polynomial-Time Recursive Algorithm for some Unconstrained Quadratic Optimization Problems. CTW 2009: 105-108, Paris, France

·         W. Ben-Ameur, M. Zotkiewicz, More adaptive robust stable routing, In proc of IEEE Globecom 2009, Hawaii, USA

·         W. Ben-Ameur, M. Żotkiewicz: Polynomial traffic demand polytope partitioning, Electronic Notes in Discrete Mathematics (Proceedings of ISCO 2010), Volume 36, 1 August 2010, Pages 1113-1120

·         W. Ben-Ameur, M. Hadji, Steiner Networks with unicyclic connected components, Electronic Notes in Discrete Mathematics (Proceedings of ISCO 2010), Volume 36, 1 August 2010, Pages 969-976

·         W. Ben-Ameur, M. Didi Biha, Algorithms and formulations for the minimum cut separator problem, Electronic Notes in Discrete Mathematics (Proceedings of ISCO 2010),  Volume 36, 1 August 2010, Pages 977-983

·         W. Ben-Ameur, M. Hadji, A. Ouorou, Networks with unicyclic connected components and without short cycles, Electronic Notes in Discrete Mathematics (Proceedings of ISCO 2010),  Volume 36, 1 August 2010, Pages 961-968

·         M. Żotkiewicz, W. Ben-Ameur, M. Pióro, Failure disjoint paths, Electronic Notes in Discrete Mathematics (Proceedings of ISCO 2010),  Volume 36, 1 August 2010, Pages 1105-1112

·         W. Ben-Ameur, Pablo pavon Marino, Michal pioro: on traffic domination in communication networks, Proceedings of PERFORM 2010, pages 191-202, Springer,  LNCS 6921 (2011)  

·         P. Bauguion, W. Ben-Ameur, E. Gourdin, Cache Location in tree networks; preliminary results,  Proceedings of INOC 2011, Juila Pahl, Torsten Teiners and Stefan VoB (Eds.), pages 517-522, Springer,  LNCS 6701

 To send a message