Continuous covering on networks: Improved mixed integer programming formulations M Pelegrín, L Xu Omega 117, 102835, 2023 | 7 | 2023 |
Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks L Xu, S Haddad Vanier Networks 80 (1), 123-148, 2022 | 7 | 2022 |
Optimal location of safety landing sites L Xu LIX, École Polytechnique, 2021 | 4 | 2021 |
Submodular maximization and its generalization through an intersection cut lens L Xu, L Liberti Mathematical Programming, 1-37, 2024 | 1 | 2024 |
Branch and price for submodular bin packing L Xu, C d'Ambrosio, S Haddad-Vanier, E Traversi EURO Journal on Computational Optimization 11, 100074, 2023 | 1 | 2023 |
Cutting planes for signomial programming L Xu, C D'Ambrosio, L Liberti, SH Vanier arXiv preprint arXiv:2212.02857, 2022 | 1 | 2022 |
Relaxations for binary polynomial optimization via signed certificates L Xu, L Liberti arXiv preprint arXiv:2405.13447, 2024 | | 2024 |
Formulations of the continuous set-covering problem on networks: a comparative study L Xu, C D'Ambrosio arXiv preprint arXiv:2404.10467, 2024 | | 2024 |