Sonia Vanier

My research interests are:
– Mathematical programming
– Combinatorial optimization
– Graph theory
– Network optimization
– Development of decision-making tools for complex industrial problems

o Research award and research label awarded for the ALOES project developed at
Orange Labs by the Sophia-Antipolis Telecom Valley association.

Current research projects:
– Optimization methods for banking data analysis: development of tools combining
mathematical programming approaches and learning methods for data analysis in online
banking transactions.
– Energy-saving problems in Ad Hoc multi-Hop Wireless networks: mathematical
programming tools for determining the minimum number of network components to keep
on to ensure traffic routing, incorporating interference constraints and network coding
– Optimal placement of safety landing sites (SLS) for future urban air mobility offerings:
Vertical take-off and landing vehicles (VTOL) are used to transport passengers between
skyports in urban air mobility. Safety landing sites (SLS) cover VTOL trajectories for
emergency landings. We are studying the optimal placement of SLS in the air transport
network under budget, routing and safety constraints.
– Defense tools against DDoS (Distributed-Denial of Service) attacks in virtualized and
centralized software defined networks (SDN): development of decision support tools for
the deployment of virtual functions for security against DDoS cyber-attacks.
– Unsplittable multicommodity flow problems for networks routing optimization: polyhedral
approaches to solving the combinatorial problems related to unsplittable and constrained
routing in networks.
Previous projects:
– GDRRO (CNRS Operational Research Group): combinatorial optimization tools for
network design problems, join work with Michel Minoux (LIP6) and Arnaud Knippel (LMI
ENSA Rouen).
– ALOES Orange Labs Project: Design of secured networks and traffic routing optimization
tools for the Orange's backbone network. Development of decomposition methods,
column generation and branch-price-cut algorithms. The theoretical part of the project that
I developed was awarded the research award and the research label awarded by the
Telecom Valley Sophia-Antipolis association.
– Optimization of marine terminals infrastructure for oil marketing: development of Software
for optimizing the behavior of an oil port (transport, management and marketing of

– Decision support tool for the placement of virtual security functions against DDoS
(Distributed Denial of Service) cyber attacks for virtualized SDN (software defined
network) networks. Project Orange Garden.

– Network design and routing optimization tool for Orange's backbone network. Tools to
plan and design secure network against breakdowns, project ALOES Orange Labs
Sophia Antipolis join work with Frédérique Millo.
– Software to simulate the behavior of an oil port (transport, management and marketing of
hydrocarbons). A tool for planning and optimizing the infrastructure of marine oil
– Claudia D'Ambrosio, Leo Liberti, Mauro Escobar, Xu Liding of LIX (X Computer Science
– Céline Gicquel LRI (Computer Science Research Laboratory) University of Paris Saclay.
– Andrea Lodi (Montreal Polytechnic) Kahina Lazri Orange Labs.
– Ivana Ljubic (ESSEC and LAMSADE) and Ridha Mahjoub LAMSADE (Systems Analysis
Laboratory for the Paris Dauphine Decision).
– Michel Minoux, Vient Hung Nguyen Lip6 (Paris Computer Laboratory 6).
Scientific animations:
– Scientific board of the GDR Operation Research of the CNRS. Head of the GdT OR
Working Group since 2007. GdT OR : Optimisation dans les réseaux
– Organization of the workshop Autumn school on Advanced BCP Tools: VRPSolver and
Coluna, November 21 and 22, 2019, more than 110 participants.
– Organized jack Edmonds' 85th Birthday Seminar on May 3, 2019 at the Sorbonne. 50
participants. Article published in The Pantheon-Sorbonne letter number 29.
– Optimization and Big Data Conference on March 27, 2019 at the Sorbonne, Professor
Andrea Lodi's visit to Paris1. More than 100 academic and industrial participants.
Important scientific spin-offs.
Article published in the first issue of the magazine of Paris1 Panthéon-Sorbonne #1257.
– Organization of the Graph Partitioning sessions at the ISCO conference, 70 participants.
– Regular (twice a year) organization of workshops on network optimization and sessions at
Roadef, EURO (European Operational Research Conference), ISCO (International
Symposium on Combinatorial Optimization), DRCN (International Conference on the
Design of Reliable Communication Networks), JPOC (Day Polyhedron and Combinatory
Currently in charge of the following courses:
– Continuous and combinatory optimization for data analysis, Master2 TIDE
– Statistical learning Master2 MMMEF
– C++ Programming Matser2 IRFA and Matser2 MMMEF
– Mathematical Programming Techniques for Decision making M1 MIAGE
– Algorithmics and Graph Theory M1 MIAGE
– Operational Research L3 MIAGE
Previously responsible for the following courses:
– Computer Science Reinforcement L2 MIASHS

– Architecture of Computers and Operating Systems L2 and L3 MIASHS and L3 MIAGE
– Systems and Networks Programming L3 MIAGE
– Combinatorial Optimization M1 MIAGE
– Mathematics for Computer Science, L2, L3 MIASHS, L3 MIAGE, Paris1-SciencesPo-HEC
– Algorithmic and Object-Oriented Programming in Java L3 MIAGE
– Algorithmics and data structures L1 MIASHS
– Introduction to Programming in C L1 MIASHS
– Relational databases M1 MSG (Management)
Other lessons:
– Massive data processing and parallel computation at Ecole Polytechnique
– Algorithms for data analysis with C++ at Ecole Polytechnique.
– Cyber Security Training Course ExEd Polytechnic Https://
– Professional training of Orange, Alcatel and the Sophia-Antipolis Foundation
– Network Courses at IUT Nice Sophia-Antipolis
– TPs Java at the University of Nice.
Mentoring students:
– More than 200 L3 and M1 students during their apprenticeships and internships
– More than 40 research internship supervision in the following Master 2 in Paris 1: TIDE
(Information Technology and Data Sciences in Enterprise), IKSEM (Information
Knowledge Systems Engineering and Management) and M2 S2I (Information Systems
and Innovation).
– Polytechnic 2A Projects supervision for Massive Data Processing course and Algorithms
for Data Analysis in C++ course
– Research internship supervision 3A and M2 at LIX
– Research internship supervision of the M2 MODO (Optimization Modeling, Decision and
Organization) of the University of Paris Dauphine.
– Elected member of the UFR Mathematics and Computer Science Board since 2008
– Elected member of the Scientific Advisory Council (SCC) since 2008
– Elected member of the SAMM laboratory board since 2012
– Head of business relations for the M2 TIDE (Information Technology and Data Science in
– Member of the steering committees and the development committees of the MIASHS and
MIAGE trainings in Paris1
– Member of the selection committees for Paris1 associate professor positions
– Member of the selection committees for the associate professor positions at the computer
science department of Ecole Polytechnic
– Teacher referent to UFR27 students wishing to follow computer science training.
Publications and Communications:
 L. Xu, S. Haddad Vanier. Branch-and-Price for Energy Optimization in Wireless
Multi-Hop Networks. Full paper under revision to Networks International journal.
 C. Gicquel, S. Haddad Vanier, Alexandros Papadimitriou. Optimal deployment of
virtual network functions for securing telecommunication networks against distributed
denial of service attacks : a robust optimization approach, Full paper submitted to
Computers & Operations Research (CORE).
 Sonia Haddad-Vanier, Liding Xu. Exact approaches for unsplittable data transmission
in Wireless Networks with energy challenges. Accepted to European Chapter of
Combinatorial Optimization.

 Mauro Escobar, Claudia D’Ambrosio, Leo Liberti, Sonia Vanier. Integer Formulation
for Computing Transaction Aggregation to Detect Credit Card Fraud. Accepted to
CTW (Workshop on Graph Theory and Combinatorial Optimization).
 Sonia Haddad-Vanier, Celine Gicquel, Alexandros Papadimitriou. Optimal
deployment of security virtual functions in Software-Defined Networks (SDN).
Accepted to CTW (Workshop on Graph Theory and Combinatorial Optimization).
 S. Haddad Vanier, L. Xu. A Branch and Price and cut Approach for clique capacity
network routing with opportunistic coding, working paper.
 -* Mauro Escobar, Claudia D’Ambrosio, Sonia Haddad-Vanier, Leo Liberti, On
behavioral functions used in credit card fraud detection. working paper.
 Liding Xu, Claudia D’Ambrosio, Sonia Haddad-Vanier, Leo Liberti, Optimal
Location of Safety Landing Sites, working paper.
 S. Haddad Vanier, A. Papadimitriou, C. Gicquel, C. D’Ambrosio, A.Lodi.
Mathematical Programming models for Defence against DDoS cyber attacks, working
 S. Haddad Vanier. Optimisation combinatoire, Big Data et cyber sécurité , La Revue
de l’Université Panthéon Sorbonne, La rencontre 1257, Numero1 Juin 2019.
 S. Haddad-Vanier, C. Gicquel, L. Boukhatem, K. Lazri, P. Chaignon. Virtual Network
Functions Placement for Defense Against Distributed Denial of Service Attacks, In
Proceedings ICORES, International Conference on Operations Research and
Enterprise Systems, pp. 142-150, 2019.
 S. Haddad Vanier, A. Papadimitriou, C. Gicquel, K. Lazri. Mathematical
Programming models for Cyber Attack Defense, In Proceedings EURO – European
Conference on Operational Research, Dublin, 2019.
 S. Haddad Vanier, A.Knippel. Inégalités valides pour le monoroutage, In Proceedings
ROADEF – Congrès annuel de la Société Française de recherche opérationnelle et
d’aide -a la décision, Le Havre, 2019.
 S. Haddad Vanier. Energy efficient in Wireless Networks Problem, In Proceedings
ISMP – International Conference on Mathematical Programming, Bordeaux, 2018.
 S. Haddad Vanier. Column Generation for the Energy efficient in Multi-Hop Wireless
Networks Problem, In Proceedings of CTW – Workshop on Graph Theory and
Combinatorial Optimization, Paris, 2018.
 S. Haddad Vanier, A. Knippel. New Partition Inequalities for the Unsplittable flow
problems. In Proceedings ISCO – International Symposium on Combinatorial
Optimization, Marakesk, 2018.
 S. Haddad Vanier, A. Knippel. Unsplittable flow problem, In Proceedings EURO –
European Conference on Operational Research, Valencia, 2018.
 S. Haddad Vanier. Approches Polyèdrales pour les multiflots entiers, Workshop
GDRRO, LIP6, Paris, 2017.
 S. Haddad Vanier. Graph partitionning and unsplittable flows, Workshop JOR, Paris,
 S. Haddad Vanier. Approches polyèdrales pour les Problèmes de partition dans les
graphes, Journées du groupe de travail Graphes et Réseaux, Paris1, 2015.
 S. Haddad Vanier. Problèmes de flots contraints et leurs applications, Journées du
groupe de travail Graphes et Réseaux, Paris1, 2014.
 S. Haddad Vanier. Optimisation combinatoire, Problèmes de Multiflots et les
télécommunications, Séminaires des Systèmes Complexes, 2013.
 S. Vanier. Complexité des Problèmes de multifots avec réutilisation des capacités,
journées JOR, 2012.

 S. Haddad Vanier, A.Knippel. Multiflots entiers, bin-packing et routages dans les
Réseaux , In Proceedings ROADEF – Congrés annuel de la Société française de
recherche opérationnelle et d’aide à la décision, 2009.
 S. Haddad Vanier. Application des méthodes de l’Optimisation Combinatoire -a la
Conception des Réseaux, Journées Industrielles du GDRRO, Paris, 2007.
 S. Haddad Vanier, Algorithmes de génération de colonnes et de génération de coupes
pour les Problèmes de multifots contraints dans les réseaux, Semestre thématique en
Optimisation Combinatoire au CRM de l’Université de Montréal, 2006.
 S. Haddad Vanier. Nouvelles inégalités valides pour la sécurisation avec réutilisation
des capacités dans les réseaux de télécommunications, In Proceedings JOPT’06 –
Journées d’Optimisation, Quebec, 2006.
 S. Haddad Vanier. Impact du choix de la politique de sécurisation dans les Problèmes
de dimensionnement des réseaux. Colloque International du 25e anniversaire du
GERAD, 2005.
 S. Haddad Vanier. Réacheminement de bout en bout dans les réseaux de
télécommunications. In Proceedings JOPT’05 – Journées d’Optimisation, Montréal,
 S. Haddad Vanier. Dimensionnement global des réseaux de transmission, Numéro
spécial COSI’05 – Colloque sur l’Optimisation et les systèmes d’Informations, 2005.
 JF. Maurras, S. Vanier. Networks Synthesis Under Survivability Constraints, 4OR –
Quaterly Journal of the Belgian, French and Italian Operation Research Societies,
Volume2 pp. 53-67, 2004 .
 Sonia Haddad. Outils de dimensionnement des réseaux de télécommunications. In
 JPOC’03 – Journées Polyèdres et Optimisation Combinatoire, Clermont-Ferrand,
 Sonia Haddad, JF.Maurras. Survivability in Telecommunication Networks, In
Proceedings ECCO European Chapter on Combinatorial Optimization, Lugano, 2002.
 Sonia Haddad, JF.Maurras. Simultaneous Optimization of Capacity and Routing in
Telecommunication Networks, In Proceedings 6éme Congrès international de la
Théorie des Graphes, Marseille, 2000.
 Sonia Haddad, JF.Maurras. Global Designing of Secure Networks with Reusing freed
Resources, In Proceedings Combinatorial Optimization, Londre, 2000.
 Sonia Haddad, JF.Maurras. Designing Telecommunication Networks, In Proceedings
ECCO – the European Chapter of Combinatorial Optimization, Capri, 2000.
 S.Haddad, D.Aissani, S.Adjabi, S.Meftaly. Optimisation du parc de stockage des
hydrocarbures au niveau d’un terminal marin, MOAD, pp. 03-15, Bel-Abbes, 2000.
 19. S.Haddad, S. Adjabi. Modèles de prévision à court terme des quantités
d’hydrocarbures à transporter et à exporter par SONATRACH sur le pipe H.E.H-
Bejaia. In Proceedings MOAD, pp. 10-16, Bel-Abbes, 2000.
 S. Adjabi, D. Aissani, S. Haddad, S. Meftaly. Optimization of Hydrocarbon Storage
Park at a Marine Terminal Level. In proceedings of the 5th International Conference
of the Decision Sciences Institute, Volume II, pp. 1850-1862, Athena, 1999.
 S. Haddad, S Adjabi. Models of Forecasting to court terms of quantities of
Hydrocarbons To transport and Export by the Algerian Oil Company SONATRACH.
In proceedings of the 5th International Conference of the Decision Sciences Institute,
Volume II, pp. 1853-1867, Athena, 1999.