Xu Liding

Preprints

1. Xu, L., and Pokutta, S. (2026). Joint-Range Inequalities for Nonconvex QCQPs. [arXiv]
   [BibTeX]

   @misc{2026_XuPokutta_Jointrangeinequalities_2608-03318,
     archiveprefix = {arXiv},
     eprint = {2608.03318},
     arxiv = {arXiv:2608.03318},
     primaryclass = {math.OC},
     year = {2026},
     author = {Xu, Liding and Pokutta, Sebastian},
     title = {Joint-Range Inequalities for Nonconvex QCQPs},
     date = {2026-08-04}
   }

2. Xu, L., Zhou, Y., and Pokutta, S. (2026). Agentic MIP Research: Accelerated Constraint Handler Generation. [arXiv]
   [BibTeX]

   @misc{2026_XuZhouPokutta_Agenticmip_2605-09186,
     archiveprefix = {arXiv},
     eprint = {2605.09186},
     arxiv = {arXiv:2605.09186},
     primaryclass = {cs.AI},
     year = {2026},
     author = {Xu, Liding and Zhou, Yugeng and Pokutta, Sebastian},
     title = {Agentic MIP Research: Accelerated Constraint Handler Generation},
     date = {2026-05-09}
   }

3. Xu, L., Liu, Y.-C., and Pokutta, S. (2025). Convex semidefinite tensor optimization and quantum entanglement. [arXiv]
   [BibTeX]

   @misc{2025_XuLiuPokutta_Semidefinitetensors_2511-05258,
     month = nov,
     archiveprefix = {arXiv},
     eprint = {2511.05258},
     arxiv = {arXiv:2511.05258},
     primaryclass = {math.OC},
     year = {2025},
     author = {Xu, Liding and Liu, Ye-Chao and Pokutta, Sebastian},
     title = {Convex semidefinite tensor optimization and quantum entanglement},
     date = {2025-11-07}
   }

4. Hojny, C., Besançon, M., Bestuzheva, K., Borst, S., Dionísio, J., Ehls, J., Eifler, L., Ghannam, M., Gleixner, A., Göß, A., Hoen, A., von Holly-Ponientzietz, J., van der Hulst, R., Kamp, D., Koch, T., Kofler, K., Lentz, J., Lübbecke, M., Maher, S. J., … Xu, L. (2025). The SCIP Optimization Suite 10.0. [arXiv]
   [BibTeX]

   @misc{2025_ChristopherEtAl_Scip10_2511-18580,
     archiveprefix = {arXiv},
     eprint = {2511.18580},
     arxiv = {arXiv:2511.18580},
     primaryclass = {math.OC},
     year = {2025},
     author = {Hojny, Christopher and Besançon, Mathieu and Bestuzheva, Ksenia and Borst, Sander and Dionísio, João and Ehls, Johannes and Eifler, Leon and Ghannam, Mohammed and Gleixner, Ambros and Göß, Adrian and Hoen, Alexander and von Holly-Ponientzietz, Jacob and van der Hulst, Rolf and Kamp, Dominik and Koch, Thorsten and Kofler, Kevin and Lentz, Jurgen and Lübbecke, Marco and Maher, Stephen J. and Meinhold, Paul Matti and Mexi, Gioni and Mohr, Til and Mühmer, Erik and Patel, Krunal Kishor and Pfetsch, Marc and Pokutta, Sebastian and Reinartz Groba, Chantal and Serrano, Felipe and Shinano, Yuji and Turner, Mark and Vigerske, Stefan and Walter, Matthias and Weninger, Dieter and Xu, Liding},
     title = {The SCIP Optimization Suite 10.0},
     date = {2025-11-23}
   }

5. Bolusani, S., Besançon, M., Bestuzheva, K., Chmiela, A., Dionísio, J., Donkiewicz, T., van Doornmalen, J., Eifler, L., Ghannam, M., Gleixner, A., Graczyk, C., Halbig, K., Hedtke, I., Hoen, A., Hojny, C., van der Hulst, R., Kamp, D., Koch, T., Kofler, K., … Xu, L. (2024). The SCIP Optimization Suite 9.0 (ZIB Report No. 24-02-29). Zuse Institute Berlin. [URL] [arXiv] [code]
   [BibTeX]

   @techreport{2024_BolusaniEtAl_Scip9,
     year = {2024},
     institution = {Zuse Institute Berlin},
     type = {ZIB Report},
     month = feb,
     number = {24-02-29},
     url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-95528},
     archiveprefix = {arXiv},
     eprint = {2402.17702},
     arxiv = {arXiv:2402.17702},
     primaryclass = {math.OC},
     author = {Bolusani, Suresh and Besançon, Mathieu and Bestuzheva, Ksenia and Chmiela, Antonia and Dionísio, João and Donkiewicz, Tim and van Doornmalen, Jasper and Eifler, Leon and Ghannam, Mohammed and Gleixner, Ambros and Graczyk, Christoph and Halbig, Katrin and Hedtke, Ivo and Hoen, Alexander and Hojny, Christopher and van der Hulst, Rolf and Kamp, Dominik and Koch, Thorsten and Kofler, Kevin and Lentz, Jurgen and Manns, Julian and Mexi, Gioni and Mühmer, Erik and Pfetsch, Marc and Schlösser, Franziska and Serrano, Felipe and Shinano, Yuji and Turner, Mark and Vigerske, Stefan and Weninger, Dieter and Xu, Liding},
     title = {The SCIP Optimization Suite 9.0},
     code = {https://scipopt.org},
     date = {2024-02-27}
   }

6. Xu, L., and D’Ambrosio, C. (2024). Formulations of the continuous set-covering problem on networks: a comparative study. [arXiv]
   [BibTeX]

   @misc{2024_XuDambrosio_Continuoussetcovering,
     archiveprefix = {arXiv},
     eprint = {2404.10467},
     arxiv = {arXiv:2404.10467},
     primaryclass = {math.OC},
     year = {2024},
     author = {Xu, Liding and D'Ambrosio, Claudia},
     title = {Formulations of the continuous set-covering problem on networks: a comparative study},
     date = {2024-04-16}
   }

Conference proceedings

1. Xu, L., Mexi, G., and Bestuzheva, K. (2025). Sparsity-Driven Aggregation of Mixed Integer Programs. Proceedings of the Symposium on Experimental Algorithms, 338, 27:1–27:15. DOI: 10.4230/lipics.sea.2025.27 [arXiv]
   [BibTeX]

   @inproceedings{2025_XuMexiBestuzheva_Sparsityaggregationmip_2502-01192,
     year = {2025},
     date = {2025-07-15},
     booktitle = {Proceedings of the Symposium on Experimental Algorithms},
     volume = {338},
     pages = {27:1--27:15},
     doi = {10.4230/lipics.sea.2025.27},
     archiveprefix = {arXiv},
     eprint = {2502.01192},
     arxiv = {arXiv:2502.01192},
     primaryclass = {math.OC},
     author = {Xu, Liding and Mexi, Gioni and Bestuzheva, Ksenia},
     title = {Sparsity-Driven Aggregation of Mixed Integer Programs}
   }

Full articles

1. Xu, L., and Liberti, L. (2026). Relaxations for Binary Polynomial Optimization via Signed Certificates. Mathematics of Operations Research, moor.2024.0534. DOI: 10.1287/moor.2024.0534 [arXiv]
   [BibTeX]

   @article{2024_XuLiberti_RelaxationsBinaryPolynomial,
     year = {2026},
     journal = {Mathematics of Operations Research},
     pages = {moor.2024.0534},
     doi = {10.1287/moor.2024.0534},
     archiveprefix = {arXiv},
     eprint = {2405.13447},
     arxiv = {arXiv:2405.13447},
     primaryclass = {math.OC},
     author = {Xu, Liding and Liberti, Leo},
     title = {Relaxations for Binary Polynomial Optimization via Signed Certificates}
   }

2. Xu, L., D’Ambrosio, C., Liberti, L., and Haddad-Vanier, S. (2025). Cutting Planes for Signomial Programming. SIAM Journal on Optimization, 35(2), 899–926. DOI: 10.1137/23m1599537 [arXiv]
   [BibTeX]

   @article{2022_XuClaudiaLeoSonia_Cuttingplanessignomial,
     year = {2025},
     journal = {SIAM Journal on Optimization},
     volume = {35},
     number = {2},
     pages = {899--926},
     doi = {10.1137/23m1599537},
     archiveprefix = {arXiv},
     eprint = {2212.02857},
     arxiv = {arXiv:2212.02857},
     primaryclass = {math.OC},
     author = {Xu, Liding and D'Ambrosio, Claudia and Liberti, Leo and Haddad-Vanier, Sonia},
     title = {Cutting Planes for Signomial Programming}
   }

3. Xu, L., and Liberti, L. (2025). Submodular maximization and its generalization through an intersection cut lens. Mathematical Programming, 211(1-2), 341–377. DOI: 10.1007/s10107-024-02059-2 [arXiv]
   [BibTeX]

   @article{2023_XuLeo_Submodularmaximization,
     year = {2025},
     journal = {Mathematical Programming},
     volume = {211},
     number = {1-2},
     pages = {341--377},
     doi = {10.1007/s10107-024-02059-2},
     archiveprefix = {arXiv},
     eprint = {2302.14020},
     arxiv = {arXiv:2302.14020},
     primaryclass = {math.OC},
     author = {Xu, Liding and Liberti, Leo},
     title = {Submodular maximization and its generalization through an intersection cut lens}
   }

4. Pelegrín, M., and Xu, L. (2023). Continuous covering on networks: Improved mixed integer programming formulations. Omega, 117, 102835. DOI: 10.1016/j.omega.2023.102835 [arXiv]
   [BibTeX]

   @article{2022_MercedesPelegrinXu_ContinuousCoveringMILP,
     year = {2023},
     journal = {Omega},
     volume = {117},
     pages = {102835},
     doi = {10.1016/j.omega.2023.102835},
     archiveprefix = {arXiv},
     eprint = {2203.00284},
     arxiv = {arXiv:2203.00284},
     primaryclass = {math.OC},
     author = {Pelegrín, Mercedes and Xu, Liding},
     title = {Continuous covering on networks: Improved mixed integer programming formulations}
   }

5. Xu, L., D’Ambrosio, C., Haddad-Vanier, S., and Traversi, E. (2023). Branch and price for submodular bin packing. EURO Journal on Computational Optimization, 11, 100074. DOI: 10.1016/j.ejco.2023.100074 [arXiv]
   [BibTeX]

   @article{2022_XuClaudiaSoniaEmiliano_Branchpricesmbp,
     year = {2023},
     journal = {EURO Journal on Computational Optimization},
     volume = {11},
     pages = {100074},
     doi = {10.1016/j.ejco.2023.100074},
     archiveprefix = {arXiv},
     eprint = {2204.00320},
     arxiv = {arXiv:2204.00320},
     primaryclass = {math.OC},
     author = {Xu, Liding and D'Ambrosio, Claudia and Haddad-Vanier, Sonia and Traversi, Emiliano},
     title = {Branch and price for submodular bin packing}
   }