Daniel Cosmin Porumbel

16 papers A 2B 1Journal 9Unranked 2

Year	Rank	Type	Title / Venue / Authors
2015	J	`jnl`	Using dual feasible functions to construct fast lower bounds for routing and location problems. Discret. Appl. Math. Daniel Cosmin Porumbel, Gilles Goncalves
2014	A	`conf`	Scoring-Based Neighborhood Dominance for the Subgraph Isomorphism Problem. CP Gilles Audemard, Christophe Lecoutre, Mouny Samy Modeliar, Gilles Goncalves, Daniel Cosmin Porumbel
2013	J	`jnl`	Informed Reactive Tabu Search for Graph Coloring. Asia Pac. J. Oper. Res. Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
2013	—	`ch.`	Recent Advances in Graph Vertex Coloring. Handbook of Optimization Philippe Galinier, Jean-Philippe Hamiez, Jin-Kao Hao, Daniel Cosmin Porumbel
2012	J	`jnl`	Heuristic algorithms and learning techniques: applications to the graph coloring problem. 4OR Daniel Cosmin Porumbel
2011	J	`jnl`	A simple and effective algorithm for the MaxMin diversity problem. Ann. Oper. Res. Daniel Cosmin Porumbel, Jin-Kao Hao, Fred W. Glover
2011	J	`jnl`	An efficient algorithm for computing the distance between close partitions. Discret. Appl. Math. Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
2011	J	`jnl`	Isomorphism Testing via Polynomial-Time Graph Extensions. J. Math. Model. Algorithms Daniel Cosmin Porumbel
2011	A	`conf`	Spacing memetic algorithms. GECCO Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
2010	J	`jnl`	A search space "cartography" for guiding graph coloring heuristics. Comput. Oper. Res. Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
2010	J	`jnl`	An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring. Comput. Oper. Res. Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
2009	J	`jnl`	A polynomial graph extension procedure for improving graph isomorphism algorithms CoRR Daniel Cosmin Porumbel
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	B	`conf`	Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms. EvoCOP Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
2009	—	`conf`	Position-Guided Tabu Search Algorithm for the Graph Coloring Problem. LION Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
2007	—	`conf`	A Study of Evaluation Functions for the Graph K-Coloring Problem. Artificial Evolution Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz