A Study of Evaluation Functions for the Graph K-Coloring Problem. - Daniel Cosmin Porumbel; Jin-Kao Hao; Pascale Kuntz (Artificial Evolution, 2007)

Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms. - Daniel Cosmin Porumbel; Jin-Kao Hao; Pascale Kuntz (EvoCOP, 2009)

Position-Guided Tabu Search Algorithm for the Graph Coloring Problem. - Daniel Cosmin Porumbel; Jin-Kao Hao; Pascale Kuntz (LION, 2009)

A polynomial graph extension procedure for improving graph isomorphism algorithms - Daniel Cosmin Porumbel (CoRR, 2009)

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). - Daniel Cosmin Porumbel (2009)

A search space "cartography" for guiding graph coloring heuristics. - Daniel Cosmin Porumbel; Jin-Kao Hao; Pascale Kuntz (Comput. Oper. Res., 2010)

An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring. - Daniel Cosmin Porumbel; Jin-Kao Hao; Pascale Kuntz (Comput. Oper. Res., 2010)

Spacing memetic algorithms. - Daniel Cosmin Porumbel; Jin-Kao Hao; Pascale Kuntz (GECCO, 2011)

A simple and effective algorithm for the MaxMin diversity problem. - Daniel Cosmin Porumbel; Jin-Kao Hao; Fred W. Glover (Ann. Oper. Res., 2011)

An efficient algorithm for computing the distance between close partitions. - Daniel Cosmin Porumbel; Jin-Kao Hao; Pascale Kuntz (Discret. Appl. Math., 2011)

Isomorphism Testing via Polynomial-Time Graph Extensions. - Daniel Cosmin Porumbel (J. Math. Model. Algorithms, 2011)

Heuristic algorithms and learning techniques: applications to the graph coloring problem. - Daniel Cosmin Porumbel (4OR, 2012)

Informed Reactive Tabu Search for Graph Coloring. - Daniel Cosmin Porumbel; Jin-Kao Hao; Pascale Kuntz (Asia Pac. J. Oper. Res., 2013)

Recent Advances in Graph Vertex Coloring. - Philippe Galinier; Jean-Philippe Hamiez; Jin-Kao Hao; Daniel Cosmin Porumbel (Handbook of Optimization, 2013)

Scoring-Based Neighborhood Dominance for the Subgraph Isomorphism Problem. - Gilles Audemard; Christophe Lecoutre; Mouny Samy Modeliar; Gilles Goncalves; Daniel Cosmin Porumbel (CP, 2014)

Using dual feasible functions to construct fast lower bounds for routing and location problems. - Daniel Cosmin Porumbel; Gilles Goncalves (Discret. Appl. Math., 2015)

The Capacitated Vehicle Routing Problem with Evidential Demands: A Belief-Constrained Programming Approach. - Nathalie Helal; Frédéric Pichon; Daniel Porumbel; David Mercier; Eric Lefèvre (BELIEF, 2016)

Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation. - Daniel Porumbel (Math. Program., 2016)

A Recourse Approach for the Capacitated Vehicle Routing Problem with Evidential Demands. - Nathalie Helal; Frédéric Pichon; Daniel Porumbel; David Mercier; Eric Lefèvre (ECSQARU, 2017)

Iterated Local Search and Column Generation to solve Arc-Routing as a permutation set-covering problem. - Daniel Porumbel; Gilles Goncalves; Hamid Allaoui; Tienté Hsu (Eur. J. Oper. Res., 2017)

Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems. - Daniel Porumbel; François Clautiaux (INFORMS J. Comput., 2017)

From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints. - Daniel Porumbel (Discret. Optim., 2018)

The capacitated vehicle routing problem with evidential demands. - Nathalie Helal; Frédéric Pichon; Daniel Porumbel; David Mercier; Eric Lefèvre (Int. J. Approx. Reason., 2018)

Prize-collecting set multicovering with submodular pricing. - Daniel Porumbel (Int. Trans. Oper. Res., 2018)

Distance-guided local search. - Daniel Porumbel; Jin-Kao Hao (J. Heuristics, 2020)

Projective Cutting-Planes. - Daniel Porumbel (SIAM J. Optim., 2020)

Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems. - Daniel Porumbel (INFORMS J. Comput., 2022)

Semidefinite Programming by Projective Cutting Planes. - Daniel Porumbel (CoRR, 2023)

Using an exact bi-objective decoder in a memetic algorithm for arc-routing (and other decoder-expressible) problems. - Daniel Porumbel; Igor Machado Coelho; El-Ghazali Talbi (Eur. J. Oper. Res., 2024)