default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Cosmin Porumbel
Person information
- affiliation: Conservatoire National des Arts et Métiers (CNAM), Paris, France
- affiliation (former): University of Artois, Bethune, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Daniel Porumbel, Igor Machado Coelho, El-Ghazali Talbi
:
Using an exact bi-objective decoder in a memetic algorithm for arc-routing (and other decoder-expressible) problems. Eur. J. Oper. Res. 313(1): 25-43 (2024)- 2023
- [i2]Daniel Porumbel:
Semidefinite Programming by Projective Cutting Planes. CoRR abs/2311.09365 (2023) - 2022
- [j17]Daniel Porumbel:
Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems. INFORMS J. Comput. 34(5): 2736-2753 (2022) - 2020
- [j16]Daniel Porumbel, Jin-Kao Hao:
Distance-guided local search. J. Heuristics 26(5): 711-741 (2020) - [j15]Daniel Porumbel:
Projective Cutting-Planes. SIAM J. Optim. 30(1): 1007-1032 (2020)
2010 – 2019
- 2018
- [j14]Daniel Porumbel:
From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints. Discret. Optim. 29: 148-173 (2018) - [j13]Nathalie Helal, Frédéric Pichon, Daniel Porumbel, David Mercier, Eric Lefèvre:
The capacitated vehicle routing problem with evidential demands. Int. J. Approx. Reason. 95: 124-151 (2018) - [j12]Daniel Porumbel:
Prize-collecting set multicovering with submodular pricing. Int. Trans. Oper. Res. 25(4): 1221-1239 (2018) - 2017
- [j11]Daniel Porumbel, Gilles Goncalves, Hamid Allaoui, Tienté Hsu:
Iterated Local Search and Column Generation to solve Arc-Routing as a permutation set-covering problem. Eur. J. Oper. Res. 256(2): 349-367 (2017) - [j10]Daniel Porumbel, François Clautiaux:
Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems. INFORMS J. Comput. 29(1): 170-184 (2017) - [c7]Nathalie Helal, Frédéric Pichon, Daniel Porumbel, David Mercier, Eric Lefèvre:
A Recourse Approach for the Capacitated Vehicle Routing Problem with Evidential Demands. ECSQARU 2017: 190-200 - 2016
- [j9]Daniel Porumbel:
Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation. Math. Program. 155(1-2): 147-197 (2016) - [c6]Nathalie Helal, Frédéric Pichon, Daniel Porumbel, David Mercier, Eric Lefèvre:
The Capacitated Vehicle Routing Problem with Evidential Demands: A Belief-Constrained Programming Approach. BELIEF 2016: 212-221 - 2015
- [j8]Daniel Cosmin Porumbel, Gilles Goncalves:
Using dual feasible functions to construct fast lower bounds for routing and location problems. Discret. Appl. Math. 196: 83-99 (2015) - 2014
- [c5]Gilles Audemard, Christophe Lecoutre, Mouny Samy Modeliar, Gilles Goncalves, Daniel Cosmin Porumbel:
Scoring-Based Neighborhood Dominance for the Subgraph Isomorphism Problem. CP 2014: 125-141 - 2013
- [j7]Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz:
Informed Reactive Tabu Search for Graph Coloring. Asia Pac. J. Oper. Res. 30(4) (2013) - [p1]Philippe Galinier, Jean-Philippe Hamiez, Jin-Kao Hao, Daniel Cosmin Porumbel:
Recent Advances in Graph Vertex Coloring. Handbook of Optimization 2013: 505-528 - 2012
- [j6]Daniel Cosmin Porumbel:
Heuristic algorithms and learning techniques: applications to the graph coloring problem. 4OR 10(4): 393-394 (2012) - 2011
- [j5]Daniel Cosmin Porumbel, Jin-Kao Hao, Fred W. Glover:
A simple and effective algorithm for the MaxMin diversity problem. Ann. Oper. Res. 186(1): 275-293 (2011) - [j4]Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz:
An efficient algorithm for computing the distance between close partitions. Discret. Appl. Math. 159(1): 53-59 (2011) - [j3]Daniel Cosmin Porumbel:
Isomorphism Testing via Polynomial-Time Graph Extensions. J. Math. Model. Algorithms 10(2): 119-143 (2011) - [c4]Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz:
Spacing memetic algorithms. GECCO 2011: 1061-1068 - 2010
- [j2]Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz:
A search space "cartography" for guiding graph coloring heuristics. Comput. Oper. Res. 37(4): 769-778 (2010) - [j1]Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz:
An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring. Comput. Oper. Res. 37(10): 1822-1832 (2010)
2000 – 2009
- 2009
- [b1]Daniel Cosmin Porumbel:
Algorithmes Heuristiques et Techniques d'Apprentissage : Applications au Problème de Coloration de Graphe. (Heuristic Algorithms And Learning Techniques : Applications to the Graph Coloring Problem). University of Angers, France, 2009 - [c3]Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz:
Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms. EvoCOP 2009: 121-132 - [c2]Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz:
Position-Guided Tabu Search Algorithm for the Graph Coloring Problem. LION 2009: 148-162 - [i1]Daniel Cosmin Porumbel:
A polynomial graph extension procedure for improving graph isomorphism algorithms. CoRR abs/0903.0136 (2009) - 2007
- [c1]Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz:
A Study of Evaluation Functions for the Graph K-Coloring Problem. Artificial Evolution 2007: 124-135
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 2024-04-25 05:48 CEST 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:
