Publications

Publications on HAL



11 documents

Articles dans une revue


Communications dans un congrès

  • Romain Wallon. On Improving the Backjump Level in PB Solvers. 12th International Workshop on Pragmatics of SAT (POS'21), Jul 2021, Barcelona (hybride), Spain. ⟨hal-03381688⟩
  • Daniel Le Berre, Romain Wallon. On Dedicated CDCL Strategies for PB Solvers. 24th International Conference on Theory and Applications of Satisfiability Testing (SAT'21), Jul 2021, Barcelona (en ligne), Spain. pp.315-331, ⟨10.1007/978-3-030-80223-3_22⟩. ⟨hal-03295263⟩
  • Daniel Le Berre, Romain Wallon. Adaptation des stratégies des solveurs SAT CDCL aux solveurs PB natifs. 16es Journées Francophones de Programmation par Contraintes (JFPC'21), Jun 2021, Nice (en ligne), France. ⟨hal-03295266⟩
  • Thibault Falque, Romain Wallon, Hugues Wattez. Metrics : Mission Expérimentations. 16es Journées Francophones de Programmation par Contraintes (JFPC’21), Jun 2021, Nice (en ligne), France. ⟨hal-03295285⟩
  • Romain Wallon. Partitionnement d'Hypergraphes pour la Compilation de Formules Pseudo-Booléennes. 22e Conférence ROADEF de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF'21), Apr 2021, Mulhouse (en ligne), France. ⟨hal-03295307⟩
  • Liding Xu, Sonia Haddad-Vanier, Claudia d'Ambrosio, Leo Liberti. Optimal Location of Safety Landing Sites. European Conference on Operational Research, 2021, Athens, Greece. ⟨hal-03351011⟩
  • Antonio Mucherino, Douglas Gonçalves, Leo Liberti, Jung-Hsin Lin, Carlile Lavor, et al.. MD-JEEP: a New Release for Discretizable Distance Geometry Problems with Interval Data. FedCSIS 2020 - 15th Conference on Computer Science and Information Systems, Sep 2020, Sofia, Bulgaria. pp.1-6. ⟨hal-03030154⟩

Chapitres d'ouvrage

  • Leo Liberti. Continuous Reformulation of Binary Variables, Revisited. Mathematical Optimization Theory and Operations Research: Recent Trends, 1476, Springer International Publishing, pp.201-215, 2021, Communications in Computer and Information Science, ⟨10.1007/978-3-030-86433-0_14⟩. ⟨hal-03395333⟩

Pré-publications, Documents de travail

  • Maxime Dupuy, Claudia d'Ambrosio, Leo Liberti. Optimal paths on the ocean. 2021. ⟨hal-03404586⟩

Rapports

  • Sonia Haddad-Vanier, Céline Gicquel, Alexandros Papadimitriou. Optimal deployment of virtual network functions for securing telecommunication networks against distributed denial of service attacks: a robust optimization approach. [Research Report] OptimiX Team at LIX, Laboratoire d'Informatique de l'Ecole Polytechnique. 2020. ⟨hal-03351006⟩

Other Publications

Phil Duxbury, Carlile Lavor, Leo Liberti, Luiz de Salles-Neto, Unassigned distance geometry and molecular conformation problems, Journal of Global Optimization, accepted.

M. Pelegrín, C. D’Ambrosio, Aircraft deconfliction via Mathematical Programming: Review and insights, Transportation Science, accepted.

M. Cerulli, L. Liberti, Polynomial programming prevents aircraft (and other) conflicts, HAL open archives (hal-02971109-v2) 2021.

S. Haddad Vanier, L. Xu. Branch-and-Price for Energy Optimization in Wireless Multi-Hop Networks. Submitted to Networks International journal.

Gustavo Dias, Leo Liberti, Exploiting symmetries in mathematical programming via orbital independence, Annals of Operations Research, 298:149-182, 2021.

M. Cerulli, C. D’Ambrosio, L. Liberti, M. Pelegrín, Detecting and solving aircraft conflicts using bilevel programming, Journal of Global Optimization 1-29, 2021.

Ackooij, W., D’Ambrosio, C., Thomopulos, D., Trindade, R. S. , Decomposition and Shortest Path Problem Formulation for solving the Hydro Unit Commitment and Scheduling in a Hydro Valley. European Journal of Operational Research, 291(3): 935-943, 2021.

M Fliess, C Join, K Moussa, SM Djouadi, M Alsager, Preliminary in silico experiments: Towards new cancer treatments?, bioRxiv 2021

J Sliwak, M Anjos, L Létocart, E Traversi, A Semidefinite Optimization-based Branch-and-Bound Algorithm for Several Reactive Optimal Power Flow Problems, arXiv preprint arXiv:2103.13648, 2021

Khalife, S., Gonçalves, D., Allouah Y., and Liberti L., Further results on latent discourse models and word embeddings, HAL open archives (hal-02983109, v1), 2020.

Khalife, S., Gonçalves, D., and Liberti L., Distance geometry for word embeddings and applications, HAL open archives (hal-02892020, v1), 2020.

Claudia D’Ambrosio, Leo Liberti, Pierre-Louis Poirion, Ky Vu, Random projections for quadratic programs, Mathematical Programming B, 183:619-647, 2020.

G. Iommazzo, C. D’Ambrosio, A. Frangioni, L. Liberti, Learning to configure mathematical programming solvers by mathematical programming. In P. Pardalos, M. Brunato (Eds.), Learning and Intelligent Optimization (LION14), LNCS, 12096:377-389, Springer, New York, 2020.

D. Bienstock, M. Escobar, C. Gentile, and L. Liberti, Mathematical Programming formulations for the Alternating Current Optimal Power Flow problem, 4OR 18 (3): 249-292, 2020.

D. Bienstock and M. Escobar,Stochastic Defense Against Complex Grid Attacks, IEEE Transactions on Control of Network Systems 7 (2): 842-854, 2020

Leo Liberti, Distance Geometry and Data Science, TOP, 28:271-339, 2020.

J. Luedtke, C. D’Ambrosio, J. Linderoth, J. Schweiger. Strong convex nonlinear relaxations of the pooling problem, SIAM Journal on Optimization 30(2), 1582-1609, 2020

C. D’Ambrosio, S. Martello, M. Monaci. Lower and upper bounds for the non-linear generalized assignment problem, Computers & Operations Research 120, 104933, 2020

M Fliess, C Join, Data mining and time series segmentation via extrema: preliminary investigations, arXiv preprint arXiv:2009.09895, 2020

J Sliwak, E Andersen, MF Anjos, L Letocart, E Traversi, A Clique Merging Algorithm to Solve Semidenite Relaxations of Optimal Power Flow Problems, IEEE Transactions on Power Systems 1, 2020

F Furini, E Traversi, P Belotti, A Frangioni, A Gleixner, N Gould, L Liberti, …, QPLIB: a library of quadratic programming instances, Mathematical Programming Computation 11 (2), 237-265, 2019.

C D’Ambrosio, F Furini, M Monaci, E Traversi, On the product knapsack problem, Optimization Letters 12 (4), 691-712, 2018