default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Dupin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Nicolas Dupin:
Matheuristic Variants of DSATUR for the Vertex Coloring Problem. MIC (2) 2024: 96-111- 2023
- [j8]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): 1091-1111 (2023) - [j7]Nicolas Dupin:
Polynomial algorithms for p-dispersion problems in a planar Pareto Front. RAIRO Oper. Res. 57(2): 857-880 (2023) - [c7]Nicolas Dupin, Frank Nielsen:
Partial K-Means with M Outliers: Mathematical Programs and Complexity Results. OLA 2023: 287-303 - [i7]Nicolas Dupin, Frank Nielsen:
Partial k-means to avoid outliers, mathematical programming formulations, complexity results. CoRR abs/2302.05644 (2023) - 2022
- [c6]David Nizard, Nicolas Dupin, Dominique Quadri:
An exact dynamic programming algorithm, lower and upper bounds, applied to the large block sale problem. CoDIT 2022: 146-151 - [c5]Nicolas Dupin:
Integer Linear Programming Reformulations for the Linear Ordering Problem. OLA 2022: 74-86 - 2021
- [j6]Nicolas Dupin, Rémi Parize, El-Ghazali Talbi:
Matheuristics and Column Generation for a Basic Technician Routing Problem. Algorithms 14(11): 313 (2021) - [j5]Nicolas Dupin, El-Ghazali Talbi:
Matheuristics to optimize refueling and maintenance planning of nuclear power plants. J. Heuristics 27(1-2): 63-105 (2021) - [j4]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): 635-664 (2021) - [c4]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: 14-28 - [i6]David Nizard, Nicolas Dupin, Dominique Quadri:
An exact dynamic programming algorithm, lower and upper bounds, applied to the large block sale problem. CoRR abs/2112.12983 (2021) - 2020
- [j3]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): 185 (2020) - [j2]Nicolas Dupin, El-Ghazali Talbi:
Parallel matheuristics for the discrete unit commitment problem with min-stop ramping constraints. Int. Trans. Oper. Res. 27(1): 219-244 (2020) - [c3]Nicolas Dupin, Frank Nielsen, El-Ghazali Talbi:
Clustering a 2d Pareto Front: P-center Problems Are Solvable in Polynomial Time. OLA 2020: 179-191 - [i5]Franco Peschiera, Olga Battaïa, Alain Haït, Nicolas Dupin:
Long term planning of military aircraft flight and maintenance operations. CoRR abs/2001.09856 (2020) - [i4]Nicolas Dupin:
Polynomial algorithms for p-dispersion problems in a 2d Pareto Front. CoRR abs/2002.11830 (2020)
2010 – 2019
- 2019
- [c2]Nicolas Dupin, Frank Nielsen, El-Ghazali Talbi:
K-Medoids Clustering Is Solvable in Polynomial Time for a 2d Pareto Front. WCGO 2019: 790-799 - [i3]Nicolas Dupin, Frank Nielsen, El-Ghazali Talbi:
Planar p-center problems are solvable in polynomial time when clustering a Pareto Front. CoRR abs/1908.09648 (2019) - 2018
- [i2]Nicolas Dupin, El-Ghazali Talbi:
Clustering in a 2-dimensional Pareto Front: the p-median and p-center problems are polynomially solvable. CoRR abs/1806.02098 (2018) - [i1]Nicolas Dupin, El-Ghazali Talbi:
Matheuristics to optimize maintenance scheduling and refueling of nuclear power plants. CoRR abs/1812.08598 (2018) - 2017
- [j1]Nicolas Dupin:
Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints. EURO J. Comput. Optim. 5(1-2): 149-176 (2017) - 2016
- [c1]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: 29-40 - 2015
- [b1]Nicolas Dupin:
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). Lille University of Science and Technology, France, 2015
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
