CARVIEW

MOTORHOMES

Select Language

HTTP/2 200 server: GitHub.com content-type: text/html; charset=utf-8 last-modified: Wed, 03 Dec 2025 21:40:51 GMT access-control-allow-origin: * strict-transport-security: max-age=31556952 etag: W/"6930ae63-59dc" expires: Wed, 31 Dec 2025 05:30:02 GMT cache-control: max-age=600 content-encoding: gzip x-proxy-cache: MISS x-github-request-id: A7BC:318CF6:AB9323:C1248D:6954B282 accept-ranges: bytes age: 0 date: Wed, 31 Dec 2025 05:20:02 GMT via: 1.1 varnish x-served-by: cache-bom-vanm7210088-BOM x-cache: MISS x-cache-hits: 0 x-timer: S1767158403.751300,VS0,VE213 vary: Accept-Encoding x-fastly-request-id: a22671aaf43a32f445eb8a4728658c715c7230fc content-length: 4728 Liding Xu | IOL group, Zuse-Institut Berlin

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

Ph.D. in Computer Science, École Polytechnique, 2023
M.S. in Mathematics, Optimization track, Université Paris-Saclay & Institut Polytechnique de Paris, 2020
B.S. in Machine Intelligence, Peking University, 2018

Full CV (updated 2025-10-24): pdf

Publications

Submitted

Convex semidefinite tensor optimization and quantum entanglement (submitted)

Liding Xu, Ye-Chao Liu, Sebastian Pokutta

Technical report

Arxiv

A computational framework for continuous edge covering on networks (submitted)

Liding Xu and Claudia D'Ambrosio

Technical report

Relaxations for binary polynomial optimization via signed certificates (under minor revision)

Liding Xu and Leo Liberti

Technical report

Arxiv Code

Published

Sparsity-driven Aggregation of Mixed Integer Programs

Liding Xu, Gioni Mexi and Ksenia Bestuzheva

23rd International Symposium on Experimental Algorithms (SEA 2025)

DOI Arxiv

On Cutting Planes for Signomial Programming

Liding Xu, Claudia D'Ambrosio, Leo Liberti and Sonia Haddad Vanier

SIAM Journal on Optimization

DOI Arxiv Code

Submodular maximization and its generalization through an intersection cut lens

Liding Xu and Leo Liberti

Mathematical Programming B

DOI Arxiv Code

Continuous covering on networks: Improved mixed integer programming formulations

Mercedes Pelegrín and Liding Xu

Omega

DOI Arxiv Code

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

Branch-and-price for energy optimization in multi-hop wireless sensor networks

Liding Xu and Sonia Haddad Vanier

Networks

DOI HAL Code

Optimization in Wireless Networks

Antoine Oustry and Liding Xu, Sonia Haddad-Vanier, Juan-Antonio Cordero and Thomas Clausen

Encyclopedia of Optimization

DOI HAL

Urban Air Mobility

Liding Xu, Claudia D'Ambrosio, Sonia Haddad-Vanier and Emiliano Traversi

Encyclopedia of Optimization

DOI HAL

Reports

Ph.D. thesis

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

Relaxations for Binary Polynomial Optimization via Signed Certificates

Los Angeles, USA, 2025-07

2025 INTERNATIONAL CONFERENCE ON CONTINUOUS OPTIMIZATION (ICCOPT2025)

Slides

Modelling of piece-wise linear concave constraints in continous covering problems

Copenhagen, Denmark, 2024-07

33rd European Conference on Operational Research (EURO2024)

Slides

Branch and price for submodular bin packing

Paris, France, 2024-02

43e Journée Francilienne de Recherche Opérationnelle, BinPacking workshop (JFRO2024)

Slides

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

Intersection cuts meet submodularity: the good and the bad

Aussois, France, 2023-01

Aussois Combinatorial Optimization Workshop 2023

Slides

On a Concept of a Generic Intersection Cut Callback

Berlin, Germany, 2022-11

SCIP Workshop 2022

Slides

Cutting Planes for Signomial Programming

Szeged, Hungary, 2022-09

XV. Workshop on Global Optimization (HUGO2022)

Slides

An algorithmic toolkit for continuous set-covering on networks

Espoo, Finand, 2022-07

32st European Conference on Operational Research (EURO2022)

Slides

Optimal Location of Safety Landing Sites

Athens, Greece, 2021-07

31st European Conference on Operational Research (EURO2021)

Slides

Teaching

INF569 - Decision theory, with applications to energy systems

École Polytechnique, Palaiseau, France, 2022

Master (M1) course

CSE201 - Object-oriented Programming in C++

École Polytechnique, Palaiseau, France, 2022

Bachelor course