Nicolas Dupin

ORCID

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 23

Top Venues

Lille University of Science and Technology, France (PHD)

Education History

Lille University of Science and Technology, France

PHD

Publications

Nicolas Dupin
Matheuristic Variants of DSATUR for the Vertex Coloring Problem. MIC (2) (2024)
Nicolas Dupin, Frank Nielsen
Partial K-Means with M Outliers: Mathematical Programs and Complexity Results. OLA (2023)
Nicolas Dupin, Frank Nielsen
Partial k-means to avoid outliers, mathematical programming formulations, complexity results. CoRR (2023)
Nicolas Dupin
-dispersion problems in a planar Pareto Front. RAIRO Oper. Res. 57 (2) (2023)
Yue Su, Nicolas Dupin, Jakob Puchinger
A deterministic annealing local search for the electric autonomous dial-a-ride problem. Eur. J. Oper. Res. 309 (3) (2023)
David Nizard, Nicolas Dupin, Dominique Quadri
An exact dynamic programming algorithm, lower and upper bounds, applied to the large block sale problem. CoDIT (2022)
Nicolas Dupin
Integer Linear Programming Reformulations for the Linear Ordering Problem. OLA (2022)
Jiangnan Huang, Zixi Chen, Nicolas Dupin
Comparing Local Search Initialization for K-Means and K-Medoids Clustering in a Planar Pareto Front, a Computational Study. OLA (2021)
Franco Peschiera, Robert Dell, Johannes O. Royset, Alain Haït, Nicolas Dupin, Olga Battaïa
A novel solution approach with ML-based pseudo-cuts for the Flight and Maintenance Planning problem. OR Spectr. 43 (3) (2021)
David Nizard, Nicolas Dupin, Dominique Quadri
An exact dynamic programming algorithm, lower and upper bounds, applied to the large block sale problem. CoRR (2021)
Nicolas Dupin, Rémi Parize, El-Ghazali Talbi
Matheuristics and Column Generation for a Basic Technician Routing Problem. Algorithms 14 (11) (2021)
Nicolas Dupin, El-Ghazali Talbi
Matheuristics to optimize refueling and maintenance planning of nuclear power plants. J. Heuristics 27 (1-2) (2021)
Nicolas Dupin, El-Ghazali Talbi
Parallel matheuristics for the discrete unit commitment problem with min-stop ramping constraints. Int. Trans. Oper. Res. 27 (1) (2020)
Nicolas Dupin
Polynomial algorithms for p-dispersion problems in a 2d Pareto Front. CoRR (2020)
Nicolas Dupin, El-Ghazali Talbi
Machine Learning-Guided Dual Heuristics and New Lower Bounds for the Refueling and Maintenance Planning Problem of Nuclear Power Plants. Algorithms 13 (8) (2020)
Nicolas Dupin, Frank Nielsen, El-Ghazali Talbi
Clustering a 2d Pareto Front: P-center Problems Are Solvable in Polynomial Time. OLA (2020)
Franco Peschiera, Olga Battaïa, Alain Haït, Nicolas Dupin
Long term planning of military aircraft flight and maintenance operations. CoRR (2020)
Nicolas Dupin, Frank Nielsen, El-Ghazali Talbi
Planar p-center problems are solvable in polynomial time when clustering a Pareto Front. CoRR (2019)
Nicolas Dupin, Frank Nielsen, El-Ghazali Talbi
K-Medoids Clustering Is Solvable in Polynomial Time for a 2d Pareto Front. WCGO (2019)
Nicolas Dupin, El-Ghazali Talbi
Clustering in a 2-dimensional Pareto Front: the p-median and p-center problems are polynomially solvable. CoRR (2018)
Nicolas Dupin, El-Ghazali Talbi
Matheuristics to optimize maintenance scheduling and refueling of nuclear power plants. CoRR (2018)
Nicolas Dupin
Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints. EURO J. Comput. Optim. 5 (1-2) (2017)
Thomas Peugeot, Nicolas Dupin, Marie-Joëlle Sembely, Catherine Dubecq
MBSE, PLM, MIP and Robust Optimization for System of Systems Management, Application to SCCOA French Air Defense Program. CSDM (2016)

Nicolas Dupin.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Nicolas Dupin