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 Interests

I study mixed integer linear and nonlinear programming, with a special interest in decomposition and cutting plane methods. My primary research goal is to develop and implement efficient algorithms for optimization software systems (notably the SCIP solver), and I mostly use C++ and Julia. My research codes are usually publicly available on 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

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

  3. On Cutting Planes for Signomial Programming
    Liding Xu, Claudia D'Ambrosio, Leo Liberti and Sonia Haddad Vanier
    SIAM Journal on Optimization (to appear)

Published

  1. Submodular maximization and its generalization through an intersection cut lens
    Liding Xu and Leo Liberti
    Mathematical Programming B

  2. Continuous covering on networks: Improved mixed integer programming formulations
    Mercedes Pelegrín and Liding Xu
    Omega

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

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

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

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

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

Talks

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

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

  3. 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)

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

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

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

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

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

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.