28-01-2026 / 14:00 / EPL au bâtiment Euler salle A.002Roberto Ronco(National Research Council of Italy)will give a presentation on:On the Path-Length Matrices of Unrooted Binary TreesAbstract:The Path-Length Matrix (PLM) of an Unrooted Binary Tree (UBT) is a symmetric integer matrix of order n ≥ 3 that uniquely encodes a tree with n leaves and internal vertices of degree 3.

15-01-2026 / 15:00 / CORE C.035  Bryan David Galarza Montenegro(University of Antwerpen)will give a presentation on:An application of advanced optimization methods in Non-Emergency Medical TransportationAbstract:Non-Emergency Medical Transportation (NEMT) is becoming increasingly important as healthcare systems shift toward outpatient care and aging populations require more frequent medical a

Débat - A quoi sert l’économie ? Mercredi 17 décembre 2025, de 13h00 à 14h00 (sandwichs offerts). Louvain-la-Neuve, Place Montesquieu, 1 > LECL 93. L’économie est partout — dans les politiques publiques, sur les marchés, dans les inégalités, dans l’actualité. Mais à quoi sert-elle vraiment ?

09/12/2025 - 14:00 - EPL, Bâtiment Euleur, A.002Laszlo VéghUniversity of BonnMatroids are equitableAbstract :We show that if the ground set of a matroid can be partitioned into k≥2 bases, then for any given subset S of the ground set, there is a partition into k bases such that the sizes of the intersections of the bases with S may differ by at most one, settling a conjecture by Fekete and Szabó f

04/12/2025 - 15:00 - CORE C.035  Francesca Demelas(University of Pisa)Machine Learning for Lagrangian RelaxationAbstract: I present two machine-learning approaches to enhance Lagrangian relaxation methods.

27/11/2025 - 15:00 - B-135 Silvia Di Gregorio, Maitresse de Conference, Université Sorbonne Paris Nord A Knowledge Compilation Take on Binary Polynomial OptimizationAbstract:The Binary Polynomial Optimization (BPO) problem is defined as the problem of maximizing a given polynomial function over all binary points.

20/11/2025 - 15:00 - CORE C.035An Introduction to Modelling with GAMSPyThis workshop offers a hands-on introduction to GAMSPy. GAMSPy combines the high-performance GAMS execution system with the flexible Python language, creating a powerful mathematical optimization package.

14 & 15/11/2025 - Visio room D251Program of the day2025 Belgo-Japan Public Economics conference  Friday November 14, 202508.45 : welcome coffee/teaSESSION 1 : Taxing household and multinationals09.00-09.50 : Pierre Pestieau (University of Liège)                         Taxing inter vivos transfers and bequests

30/10/2025 - 15.00 - CORE B.-135Totally equimodular matrices: decomposition and triangulation.Abstract: One way of obtaining strong combinatorial min-max theorems is to study if a system of linear inequalities Ax≤b is totally dual integral (TDI). The MaxFlow-MinCut theorem of Ford and Fulkerson is one fine example.

23/10/2025 - CORE B-135 An exact algorithm for robust influence maximizationAbstract: We propose a Branch-and-Cut algorithm for the robust influence maximization problem. The influence maximization problem aims to identify, in a social network, a set of given cardinality comprising actors that are able to influence the maximum number of other actors.