Nicolas Dupin

Orcid: 0000-0003-3775-5629

According to our database1, Nicolas Dupin authored at least 23 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Matheuristic Variants of DSATUR for the Vertex Coloring Problem.
Proceedings of the Metaheuristics - 15th International Conference, 2024

2023
Polynomial algorithms for <i>p</i>-dispersion problems in a planar Pareto Front.
RAIRO Oper. Res., March, 2023

A deterministic annealing local search for the electric autonomous dial-a-ride problem.
Eur. J. Oper. Res., 2023

Partial k-means to avoid outliers, mathematical programming formulations, complexity results.
CoRR, 2023

Partial K-Means with M Outliers: Mathematical Programs and Complexity Results.
Proceedings of the Optimization and Learning - 6th International Conference, 2023

2022
Integer Linear Programming Reformulations for the Linear Ordering Problem.
Proceedings of the Optimization and Learning - 5th International Conference, 2022

An exact dynamic programming algorithm, lower and upper bounds, applied to the large block sale problem.
Proceedings of the 8th International Conference on Control, 2022

2021
A novel solution approach with ML-based pseudo-cuts for the Flight and Maintenance Planning problem.
OR Spectr., 2021

Matheuristics to optimize refueling and maintenance planning of nuclear power plants.
J. Heuristics, 2021

Matheuristics and Column Generation for a Basic Technician Routing Problem.
Algorithms, 2021

Comparing Local Search Initialization for K-Means and K-Medoids Clustering in a Planar Pareto Front, a Computational Study.
Proceedings of the Optimization and Learning - 4th International Conference, 2021

2020
Parallel matheuristics for the discrete unit commitment problem with min-stop ramping constraints.
Int. Trans. Oper. Res., 2020

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

Long term planning of military aircraft flight and maintenance operations.
CoRR, 2020

Machine Learning-Guided Dual Heuristics and New Lower Bounds for the Refueling and Maintenance Planning Problem of Nuclear Power Plants.
Algorithms, 2020

Clustering a 2d Pareto Front: P-center Problems Are Solvable in Polynomial Time.
Proceedings of the Optimization and Learning - Third International Conference, 2020

2019
Planar p-center problems are solvable in polynomial time when clustering a Pareto Front.
CoRR, 2019

K-Medoids Clustering Is Solvable in Polynomial Time for a 2d Pareto Front.
Proceedings of the Optimization of Complex Systems: Theory, 2019

2018
Matheuristics to optimize maintenance scheduling and refueling of nuclear power plants.
CoRR, 2018

Clustering in a 2-dimensional Pareto Front: the p-median and p-center problems are polynomially solvable.
CoRR, 2018

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

2016
MBSE, PLM, MIP and Robust Optimization for System of Systems Management, Application to SCCOA French Air Defense Program.
Proceedings of the Complex Systems Design & Management, 2016

2015
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).
PhD thesis, 2015


  Loading...