Associate professor/maître de conférences
I have worked in:
I have applied such techniques to different problems: Graph-Coloring [J3,J10,C1,C3-C6], Arc-Routing [J1,J6], Cutting-Stock [J1,J2,J6], Isomorphism [J7,C2], p-median [J6], MaxMin Diversity [J9].
D. Porumbel, From Separation to Intersection Subproblems for Optimizing Polytopes with Prohibitively Many Constraints in a Benders Decomposition Context pdf draft
D. Porumbel, J.-K. Hao, Distance-Guided Local Search Submitted pdf draft
D. Porumbel, From the separation to the intersection sub-problem in standard column generation pdf draft
[J1] D. Porumbel, Ray Projection for Optimizing Polytopes with Prohibitively Many Constraints in Set-Covering Column Generation, Mathematical Programming (pdf draft, code source), 155(1): 147-197, 2016 Springer©, doi link
[J2] D. Porumbel, François Clautiaux, Convergent Dual Bounds Using an Aggregation of Set-Covering Constraints for Capacitated Problems, INFORMS Journal of Computing, 29(1):170-184, 2017. (pdf draft)
[J3] D. Porumbel, J-K. Hao and P. Kuntz, A Search Space "Cartography" for Guiding Graph Coloring Heuristics. Computers & Operations Research, 37(4):769-778, 2010. (pdf draft), Elsevier©, doi link
[J4] D. Porumbel, Prize-Collecting Set Multi-Covering With Submodular Pricing, International Transactions in Operational Research, in press, (pdf draft), Wiley-Blackwell©
[J5] D. Porumbel, G. Goncalvez, H. Allaoui; T. Hsu;
Arc-Routing via Column Generation and Iterated Local Search in a Permutation Set-Covering Framework,
European Journal of Operational Research 256(2):349-367, 2017 pdf draft, slides Roadef 2015 (French OR congress) Elsevier© ,
[J6] D. Porumbel, G. Goncalves, Using Dual Feasible Functions to Construct Fast Lower Bounds for Routing and Location Problems, Discrete Applied Mathematics, 196: 83-99, 2015, (pdf draft), Elsevier© , doi link
[J7] D. Porumbel. Isomorphism Testing using Polynomial-Time Graph Extensions. Journal of Mathematical Modelling and Algorithms, 10(2):119-143, 2011 (pdf draft, isomorphism program GI-Ext), Springer©, doi link
[J8] D. Porumbel, J-K. Hao and P. Kuntz. An Efficient Algorithm for Computing the Distance Between Close Partitions. Discrete Applied Mathematics, 159(1):53-59, 2011, (pdf draft), Elsevier©, doi
[J9] D. Porumbel, J-K. Hao, F. Glover. A Simple and Effective Algorithm for the MaxMin Diversity Problem. Annals of Operations Research, 186 (1):275-293, 2011, (pdf draft, source code), Springer©, doi
[J10] D. Porumbel, J-K. Hao and P. Kuntz. An Evolutionary Approach with Diversity Guarantee and Well-Informed Grouping Recombination for Graph Coloring, Computers & Operations Research, 37(10):1822-1832, 2010 (pdf draft), Elsevier©, doi
[J11] D. Porumbel, J-K. Hao and P. Kuntz. Informed Reactive Tabu Search for Graph Coloring. Asia Pacific Journal of Operations Research, 30(4), pp. 1350010, 2013 (pdf draft), World Scientific Publishing©
[C1] D. Porumbel, J-K. Hao and P. Kuntz, Spacing Memetic Algorithms. In proceedings of GECCO 2011, GA track, 1061-1068. ACM. (pdf draft, slides)
[C2] G. Audemard, C. Lecoutre, M. S. Modeliar, G. Goncalves, D. Porumbel Scoring-based Neighborhood Dominance for the Subgraph Isomorphism Problem. The 20th International Conference on Principles and Practice of Constraint Programming (CP 2014)
[C3] Philippe Galinier, Jean-Philippe Hamiez, Jin-Kao Hao, Daniel Porumbel, Recent advances in graph vertex coloring, In I. Zelinka, V. Snasel, A. Abraham (eds.), Handbook of Optimization, Springer© (Intelligent Systems Series)
[C4] D. Porumbel, J-K. Hao and P. Kuntz, Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms. Evocop 2009 (9th European Conference on Evolutionary Computation in Combinatorial Optimisation, Tübingen, Germany), LNCS 5482: 121-132, 2009. (ps, pdf) Springer© among the three best paper nominees
[C5] D. Porumbel, J-K. Hao and P. Kuntz, Position-Guided Tabu Search for Graph Coloring. Accepted for the post-proceedings of LION 2009 (Learning and Intelligent OptimizatioN conference, Trento, Italy), LNCS 5851:148-162, 2009. (paper draft, slides) Springer©
[C6] D. Porumbel, J-K. Hao and P. Kuntz, A study of evaluation functions for the graph K-coloring problem. Selected papers from the 8th International Conference on Artificial Evolution (Tours, France), LNCS 4926: 124-135, 2008. (ps, pdf) Springer©
[E1] D. Porumbel, Trying to demystify the Karush-Kuhn-Tucker conditions (pdf, html).
[E2] D. Porumbel, Revisiting the bijection between planar maps and well labeled trees (pdf). In this work, we provide altenative arguments and correct a slight error of a graph theory article from around 1970s/1980s.
[PhD] D. Porumbel, PhD thesis,
Heuristic Algorithms and Learning Techniques: applications to the graph
coloring problem, 2009
More[+] (Seminars, theses)
I received the Simon Régnier prize in 2011. This prize is awarded each year by the "Société Francophone de Classification" (French-speaking Classification Society) to a researcher of maximum 35 years with a PhD thesis on classification. (slides)
Nominated for Best Paper Award (3 papers selected among more than 50), EvoCOP 2009
Bronze medal at the 41st International Mathematical Olympiad, a problem-solving competition with contestants from almost 100 countries (ranked 2nd in the qualification rounds of Romania), South Korea, 2000
Diploma for Academic Excellence of Romania's President Emil Constantinescu, 2000
I accepted review invitations from the editorial board of several journals, in random order: Canadian Mathematical Bulletin, Journal of Artificial Intelligence Research, The Computer Journal, IEEE Transactions on Evolutionary Computation, European Journal of Operations Research, Computers and Operations Research , Evolutionary Computation, Computers & Mathematics with Applications, Information Processing Letters, Expert Systems and Applications, Engineering Applications of Artificial Intelligence, Computing. I was in the program committee of different conferences (Evocop 2012, Evocop 2013, Evocop 2014, Gecco Ecom 2013, Gecco Ecom 2014, Gecco Ecom 2015, Gecco Ecom 2016, Gecco Ecom 2017). I also reviewed some papers indirectly (as a sub-reviewer) a few times (e.g., for ICTAI, CEC, GECCO, MOSIM).
I advised some master theses: Thomas Ridremont (Robust optimisation of wiring in renewable-energy installations, with Marie-Christine Costa and Cédric Bentz, 2015); Hubert Arnoux (A tool of visualisation techniques for local search methods, with J-K Hao, P. Kuntz, 2012); Junlin Zhu (Mathematical Programming Models for Graph Isomorphism, with Amélie Lambert, 2015); Ben Ibrahima Badji (Meta-heuristics for the Arc-Routing Problem, with T. Hsu, H. Allaoui, G. Goncalves, 2014); Fahrur Rozi and Mochammad Luthfi (Airport passenger flow simulation in Quest and Arena and resource allocation optimization, with G. Gonvalves, 2011).
I created a library for Graph Coloring Benchmarking during my PhD thesis.