Modélisation et résolution de grands problèmes stochastiques combinatoires, application à deux problèmes de gestion de production d'électricité. (MILP Modelling and resolution of industrial stochastic and combinatorial optimization problems, application to energy management problems). - Nicolas Dupin (2015)

MBSE, PLM, MIP and Robust Optimization for System of Systems Management, Application to SCCOA French Air Defense Program. - Thomas Peugeot; Nicolas Dupin; Marie-Joëlle Sembely; Catherine Dubecq (CSDM, 2016)

Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints. - Nicolas Dupin (EURO J. Comput. Optim., 2017)

Clustering in a 2-dimensional Pareto Front: the p-median and p-center problems are polynomially solvable. - Nicolas Dupin; El-Ghazali Talbi (CoRR, 2018)

Matheuristics to optimize maintenance scheduling and refueling of nuclear power plants. - Nicolas Dupin; El-Ghazali Talbi (CoRR, 2018)

K-Medoids Clustering Is Solvable in Polynomial Time for a 2d Pareto Front. - Nicolas Dupin; Frank Nielsen; El-Ghazali Talbi (WCGO, 2019)

Planar p-center problems are solvable in polynomial time when clustering a Pareto Front. - Nicolas Dupin; Frank Nielsen; El-Ghazali Talbi (CoRR, 2019)

Clustering a 2d Pareto Front: P-center Problems Are Solvable in Polynomial Time. - Nicolas Dupin; Frank Nielsen; El-Ghazali Talbi (OLA, 2020)

Machine Learning-Guided Dual Heuristics and New Lower Bounds for the Refueling and Maintenance Planning Problem of Nuclear Power Plants. - Nicolas Dupin; El-Ghazali Talbi (Algorithms, 2020)

Long term planning of military aircraft flight and maintenance operations. - Franco Peschiera; Olga Battaïa; Alain Haït; Nicolas Dupin (CoRR, 2020)

Polynomial algorithms for p-dispersion problems in a 2d Pareto Front. - Nicolas Dupin (CoRR, 2020)

Parallel matheuristics for the discrete unit commitment problem with min-stop ramping constraints. - Nicolas Dupin; El-Ghazali Talbi (Int. Trans. Oper. Res., 2020)

Comparing Local Search Initialization for K-Means and K-Medoids Clustering in a Planar Pareto Front, a Computational Study. - Jiangnan Huang 001; Zixi Chen; Nicolas Dupin (OLA, 2021)

Matheuristics and Column Generation for a Basic Technician Routing Problem. - Nicolas Dupin; Rémi Parize; El-Ghazali Talbi (Algorithms, 2021)

Matheuristics to optimize refueling and maintenance planning of nuclear power plants. - Nicolas Dupin; El-Ghazali Talbi (J. Heuristics, 2021)

A novel solution approach with ML-based pseudo-cuts for the Flight and Maintenance Planning problem. - Franco Peschiera; Robert Dell; Johannes O. Royset; Alain Haït; Nicolas Dupin; Olga Battaïa (OR Spectr., 2021)

An exact dynamic programming algorithm, lower and upper bounds, applied to the large block sale problem. - David Nizard; Nicolas Dupin; Dominique Quadri (CoDIT, 2022)

Integer Linear Programming Reformulations for the Linear Ordering Problem. - Nicolas Dupin (OLA, 2022)

Partial K-Means with M Outliers: Mathematical Programs and Complexity Results. - Nicolas Dupin; Frank Nielsen (OLA, 2023)

Partial k-means to avoid outliers, mathematical programming formulations, complexity results. - Nicolas Dupin; Frank Nielsen (CoRR, 2023)

A deterministic annealing local search for the electric autonomous dial-a-ride problem. - Yue Su; Nicolas Dupin; Jakob Puchinger (Eur. J. Oper. Res., 2023)

Polynomial algorithms for p-dispersion problems in a planar Pareto Front. - Nicolas Dupin (RAIRO Oper. Res., 2023)

Matheuristic Variants of DSATUR for the Vertex Coloring Problem. - Nicolas Dupin (MIC (2), 2024)