research
∙
02/11/2023
Partial k-means to avoid outliers, mathematical programming formulations, complexity results
A well-known bottleneck of Min-Sum-of-Square Clustering (MSSC, the celeb...
share
research
∙
12/24/2021
An exact dynamic programming algorithm, lower and upper bounds, applied to the large block sale problem
In this article, we address a class of non convex, integer, non linear m...
research
∙
02/26/2020
Polynomial algorithms for p-dispersion problems in a 2d Pareto Front
Having many best compromise solutions for bi-objective optimization prob...
research
∙
01/27/2020
Long term planning of military aircraft flight and maintenance operations
We present the Flight and Maintenance Planning (FMP) problem in its mili...
research
∙
12/13/2019
Column generation for the discrete Unit Commitment problem with min-stop ramping constraints
The discrete unit commitment problem with min-stop ramping constraints o...
research
∙
08/19/2019
Planar p-center problems are solvable in polynomial time when clustering a Pareto Front
This paper is motivated by real-life applications of bi-objective optimi...
research
∙
12/13/2018
Matheuristics to optimize maintenance scheduling and refueling of nuclear power plants
Scheduling the maintenances of nuclear power plants is a complex optimiz...
research
∙
06/06/2018
Clustering in a 2d Pareto Front: p-median and p-center are solvable in polynomial time
This paper is motivated by a real life application of multi-objective op...
research
∙
06/06/2018