avatar

Liding Xu

Postdoc researcher
IOL group, Zuse-Institut Berlin
liding[dot]xu[at]zib[dot]de


About Me

I am a postdoc researcher in IOL group at Zuse-Institut Berlin. I got my Ph.D. at Laboratoire d’informatique de l’École Polytechnique (LIX), where I was part of Optimix.

Research Areas

My work leverages mathematical tools from optimization theory, including lifting techniques, decomposition methods, and cutting-plane methods. These tools enable the design of reliable algorithms for hard optimization problems arising in combinatorics, operations research, and quantum physics.

Beyond theory, I am passionate about translating fundamental advances into practice—developing algorithms that can tackle challenging real-world problems while remaining reproducible and accessible. This motivation naturally connects my research to the development of robust optimization software systems, most notably through my contributions to the open source MILP solver: SCIP.

I primarily work in C++ and Julia. Source codes for my research are usually available in my GitHub repositories.

Bio

Full CV: pdf

Publications

Submitted

  1. Relaxations for binary polynomial optimization via signed certificates
    Liding Xu and Leo Liberti
    Technical report
    Arxiv Code

  2. Formulations of the continuous set-covering problem on networks: a comparative study
    Liding Xu and Claudia D'Ambrosio
    Technical report
    Arxiv Code

Published

  1. Sparsity-driven Aggregation of Mixed Integer Programs
    Liding Xu, Gioni Mexi and Ksenia Bestuzheva
    23rd International Symposium on Experimental Algorithms (SEA 2025)
    DOI Arxiv

  2. On Cutting Planes for Signomial Programming
    Liding Xu, Claudia D'Ambrosio, Leo Liberti and Sonia Haddad Vanier
    SIAM Journal on Optimization
    DOI Arxiv Code

  3. Submodular maximization and its generalization through an intersection cut lens
    Liding Xu and Leo Liberti
    Mathematical Programming B
    DOI Arxiv Code

  4. Continuous covering on networks: Improved mixed integer programming formulations
    Mercedes Pelegrín and Liding Xu
    Omega
    DOI Arxiv Code

  5. Branch and price for submodular bin packing
    Liding Xu, Claudia D'Ambrosio, Sonia Haddad-Vanier and Emiliano Traversi
    EURO Journal on Computational Optimization
    DOI Arxiv Code

  6. Branch-and-price for energy optimization in multi-hop wireless sensor networks
    Liding Xu and Sonia Haddad Vanier
    Networks
    DOI HAL Code

  7. Optimization in Wireless Networks
    Antoine Oustry and Liding Xu, Sonia Haddad-Vanier, Juan-Antonio Cordero and Thomas Clausen
    Encyclopedia of Optimization
    DOI HAL

  8. Urban Air Mobility
    Liding Xu, Claudia D'Ambrosio, Sonia Haddad-Vanier and Emiliano Traversi
    Encyclopedia of Optimization
    DOI HAL

Ph.D. thesis

  1. Relaxation methods for mixed-integer nonlinear programming
    Supervised by Leo Liberti (director of thesis), Claudia D’Ambrosio (co-director), Sonia Haddad-Vanier (co-supervision)
    LIX, École Polytechnique
    THESES.FR HAL

Talks

  1. Relaxations for Binary Polynomial Optimization via Signed Certificates
    Los Angles, USA, 2025-07
    2025 INTERNATIONAL CONFERENCE ON CONTINUOUS OPTIMIZATION (ICCOPT2025)
    Slides

  2. Modelling of piece-wise linear concave constraints in continous covering problems
    Copenhagen, Denmark, 2024-07
    33rd European Conference on Operational Research (EURO2024)
    Slides

  3. Branch and price for submodular bin packing
    Paris, France, 2024-02
    43e Journée Francilienne de Recherche Opérationnelle, BinPacking workshop (JFRO2024)
    Slides

  4. MILP formulations for continuous set-covering on networks
    Renne, France, 2023-02
    24ème édition du congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF2023)
    Slides

  5. Intersection cuts meet submodularity: the good and the bad
    Aussois, France, 2023-01
    Aussois Combinatorial Optimization Workshop 2023
    Slides

  6. On a Concept of a Generic Intersection Cut Callback
    Berlin, Germany, 2022-11
    SCIP Workshop 2022
    Slides

  7. Cutting Planes for Signomial Programming
    Szeged, Hungary, 2022-09
    XV. Workshop on Global Optimization (HUGO2022)
    Slides

  8. An algorithmic toolkit for continuous set-covering on networks
    Espoo, Finand, 2022-07
    32st European Conference on Operational Research (EURO2022)
    Slides

  9. Optimal Location of Safety Landing Sites
    Athens, Greece, 2021-07
    31st European Conference on Operational Research (EURO2021)
    Slides

Teaching

  1. INF569 - Decision theory, with applications to energy systems
    École Polytechnique, Palaiseau, France, 2022
    Master (M1) course

  2. CSE201 - Object-oriented Programming in C++
    École Polytechnique, Palaiseau, France, 2022
    Bachelor course

Services

Conference Reviewers

Journal Reviewers


Powered by Jekyll and Minimal Light theme.