Porumbel

Daniel Porumbel

Associate Professor
Team: Optimisation combinatoire
Personal website: http://cedric.cnam.fr/~porumbed
Office: 31.1.76

2026

Unpublished

  1. Lambert, A. and Porumbel, D. C. Polynomial Optimization by Quadratization and Convexification. , working paper or preprint. www 

2025

Journal Articles

  1. Lambert, A. and Porumbel, D. C. Using quadratic cuts to iteratively strengthen convexifications of box quadratic programs. In Journal of Global Optimization, 2025. doi  www 

2023

Conference Articles

  1. Lambert, A. and Porumbel, D. C. Sous-estimateurs Quadratiques convexes par morceaux pour les problèmes d'optimisation quadratique. In 24ème congrès annuel ROADEF, Rennes, France, 2023. www 
  1. Lambert, A. and Porumbel, D. C. A piecewise-quadratic convexification for exactly solving box-constrained quadratic programs. In WCGO 2023 - The 2023 World Congress on Global Optimization, Athens, Greece, 2023. www 

2022

Journal Articles

  1. Porumbel, D. Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems. In INFORMS Journal on Computing, 34 (5), 2022. doi  www 

Conference Articles

  1. Porumbel, D. C. Is there any O(2^n) algorithm you OS can run in almost no time?. In 23ème congrès annuel de la Société Franc caise de Recherche Opérationnelle et d'Aide `a la Décision, Villeurbanne - Lyon, France, 2022. www 
  1. Porumbel, D. C. Projective Cutting Planes with multiple cuts per iteration for robust linear programming. In PGMO Days 2022, Palaiseau (91), France, 2022. www 
  1. Porumbel, D. C. Is there any O(2 n ) algorithm your OS can run in almost no time ?. In ROADEF 2022, Lyon, France, 2022. www 
  1. Porumbel, D. C. A Globally-Interior Point Method in a Cutting-Planes context. In ROADEF 2022. 23ème congrès annuel de la Société Franc caise de Recherche Opérationnelle et d'Aide `a la Décision, Lyon, France, 2022. www 

2021

Conference Articles

  1. Porumbel, D. C. D'un détail d'implémentation vers un nouveau regard sur l'interpénétration entre la théorie et la programmation. In ROADEF 2021, Mulhouse (en distanciel), France, 2021. www 

2020

Journal Articles

  1. Porumbel, D. C. and Hao, J-K. Distance-guided local search. In Journal of Heuristics, 26 (5): 711-741, 2020. doi  www 
  1. Porumbel, D. C. Projective Cutting-Planes. In SIAM Journal on Optimization, 30 (1): 1007-1032, 2020. doi  www 

Conference Articles

  1. Porumbel, D. C. Demystifying the characterization of SDP matrices in mathematical programming. In ROADEF 2020, Montpelier, France, 2020. www 
  1. Porumbel, D. C. On the importance (in Operations Research) of the techniques that can make programming (withcplexorgurobi) easier. In ROADEF 2020, Montpelier, France, 2020. www 

2019

Conference Articles

  1. Porumbel, D. C. Projective Cutting-Planes : un algorithme de plans coupants `a base de projections et de points intérieurs. In ROADEF 2019, Le Havre, France, 2019. www 
  1. Porumbel, D. C. About an implementation ''detail'' : a few ideas to speed up the execution and the C++ programming (in Operations Research). In ROADEF 2019, Le Havre, France, 2019. www 

2018

Journal Articles

  1. Porumbel, D. C. From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints. In Discrete Optimization, 29: 148-173, 2018. doi  www 
  1. Helal, N.; Pichon, F.; Porumbel, D. C.; Mercier, D. and Lefevre, E. The capacitated vehicle routing problem with evidential demands. In International Journal of Approximate Reasoning, 95: 124-151, 2018. doi  www 
  1. Porumbel, D. C. Prize-collecting set multicovering with submodular pricing. In International Transactions in Operational Research, 25 (4): 1221-1239, 2018. doi  www 

Conference Articles

  1. Porumbel, D. C. Du sous-problème de séparation vers le sous-problème d'intersection dans les algorithmes de plan coupants. In ROADEF 2018, Lorient, France, 2018. www 

2017

Journal Articles

  1. Porumbel, D. C. and Clautiaux, F. c. Convergent Dual Bounds Using an Aggregation of Set-Covering Constraints for Capacitated Problems. In INFORMS Journal on Computing, 29 (1): 15, 2017. doi  www 
  1. Porumbel, D. C.; Goncalves, G.; Allaoui, H. and Hsu, T. Iterated Local Search and Column Generation to solve Arc-Routing as a permutation set-covering problem. In European Journal of Operational Research, 256 (2): 349-367, 2017. doi  www 

Conference Articles

  1. Helal, N.; Pichon, F.; Porumbel, D. C.; Mercier, D. and Lefèvre, '. Le problème de tournées de véhicules avec des demandes évidentielles. In LFA 2017 - Rencontres francophones sur la Logique Floue et ses Applications, pages 15-22, Amiens, France, 2017. www 
  1. Helal, N.; Pichon, F.; Porumbel, D. C.; Mercier, D. and Lefevre, E. A Recourse Approach for the Capacitated Vehicle Routing Problem with Evidential Demands. In Symbolic and Quantitative Approaches to Reasoning with Uncertainty 14th European Conference, ECSQARU 2017, Lugano, Switzerland, July 10--14, 2017, Proceedings, Lugano, Switzerland, 2017. www 

2016

Journal Articles

  1. Porumbel, D. C. Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation. In Mathematical Programming, 155 (1-2): 147-197, 2016. doi  www 

Conference Articles

  1. Helal, N.; Pichon, F.; Porumbel, D.; Mercier, D. and Lefevre, E. Optimisation discrète sous incertitudes modélisées par des fonctions de croyance. In 17ème congrès de la Société Franc caise de Recherche Opérationnelle et d'Aide `a la Décision, RODEF'2016, Compiègne, France, 2016. www 
  1. Helal, N.; Pichon, F.; Porumbel, D. C.; Mercier, D. and Lefèvre, '. The Capacitated Vehicle Routing Problem with Evidential Demands: a Belief-Constrained Programming Approach. In Belief Functions: Theory and Applications. BELIEF 2016, pages 212-221, Springer, Prague, Czech Republic, Lecture Notes in Computer Science 9861, 2016. doi  www 
  1. Bentz, C.; Costa, M-C.; Porumbel, D. C. and Ridremont, T. Conception de câblages robustes dans les parcs éoliens : recherche d'une Arborescence de Steiner ''robuste''. In 17ème congrès ROADEF, Compiègne, France, 2016. www 

2015

Journal Articles

  1. Porumbel, D. C. and Goncalves, G. Using dual feasible functions to construct fast lower bounds for routing and location problems. In Discrete Applied Mathematics, 196: 83-99, 2015. doi  www 

2014

Conference Articles

  1. Porumbel, D.; Hsu, T.; Allaoui, H. and Goncalves, G. Capacitated Arc Routing: Représentation Simplifiée, Décodeur Exact et Meta-heuristiques. In ROADEF - 15ème congrès annuel de la Société franc caise de recherche opérationnelle et d'aide `a la décision, Bordeaux, France, 2014. www 
  1. Porumbel, D. Génération de colonnes via un sous-problème d'intersection au lieu du sous-problème de séparation. In ROADEF - 15ème congrès annuel de la Société franc caise de recherche opérationnelle et d'aide `a la décision, Bordeaux, France, 2014. www 

2013

Journal Articles

  1. Porumbel, D. C.; Hao, J-K. and Kuntz, P. Informed Reactive Tabu Search for Graph Coloring. In Asia-Pacific Journal of Operational Research, 30 (4): 1350010, 2013. doi  www 

Book Sections

  1. Galinier, P.; Hamiez, J-P.; Hao, J-K. and Porumbel, D. C. Recent Advances in Graph Vertex Coloring. In Handbook of Optimization - From Classical to Modern Approach, pages 505-528, Springer, Intelligent Systems Reference Library 38, 2013. doi  www 

Unpublished

  1. Porumbel, D. C. and Clautiaux, F. c. Convergent Dual Bounds Using an Aggregation of Set-Covering Constraints for Capacitated Problems. , working paper or preprint. www 

2011

Journal Articles

  1. Porumbel, D. C. Isomorphism Testing via Polynomial-Time Graph Extensions. In Journal of Mathematical Modelling and Algorithms, 10 (2): 119-143, 2011. doi  www 
  1. Porumbel, D. C.; Hao, J-K. and Glover, F. A simple and effective algorithm for the MaxMin diversity problem. In Annals of Operations Research, 186 (1): 275-293, 2011. doi  www 
  1. Porumbel, D. C.; Hao, J-K. and Kuntz, P. An efficient algorithm for computing the distance between close partitions. In Discrete Applied Mathematics, 159 (1): 53-59, 2011. doi  www 

Conference Articles

  1. Porumbel, D. C.; Hao, J-K. and Kuntz-Cosperec, P. Spacing memetic algorithms. In Genetic and Evolutionary Computation Conference, Gecco 2011, pages 1061-1068, ACM, Dublin, Ireland, 2011. doi  www 

2010

Journal Articles

  1. Porumbel, D. C.; Hao, J-K. and Kuntz, P. An evolutionary Approach with Diversity Guarantee and Well-Informed Grouping Recombination for Graph Coloring. In Computers and Operations Research, 37 (10): 1822-1832, 2010. doi  www 

Conference Articles

  1. Porumbel, D. C.; Kao-Hao, J. and Kuntz, P. Diversité, dispersion réactive et croisement informé dans l'approche génétique pour la coloration de graphe. In 11ème conférence de la Société Franc caise de Recherche Opérationnelle et d'Aide `a la Décision (ROADEF), Toulouse, France, 2010. www 

2009

Journal Articles

  1. Porumbel, D. C.; Hao, J-K. and Kuntz, P. A Search Space ''Cartography'' for Guiding Graph Coloring Heuristics. In Computers and Operations Research, 37 (4): 769-778, 2009. doi  www 

Conference Articles

  1. Porumbel, D. C.; Hao, J-K. and Kuntz, P. Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms. In EVOCOP 2009, pages 121-132, Springer, Tubingen, Germany, Lecture Notes In Computer Science 5482, 2009. doi  www 
  1. Porumbel, D. C.; Kao-Hao, J. and Kuntz, P. Recherche locale guidée pour la coloration de graphes. In 10ème conf. de la Société Franc caise de Recherche Opérationnelle et d'Aide `a la Décision (ROADEF), Nancy, France, 2009. www 
  1. Porumbel, D. C.; Hao, J-K. and Kuntz, P. Position-Guided Tabu Search Algorithm for the Graph Coloring Problem. In Third International Conference, LION 3, pages 148-162, Springer, Trente, Italy, 2009. doi  www 
  1. Porumbel, D. C.; Hao, J-K. and Kuntz, P. Position Guided Tabu Search for Graph Coloring. In LION (Learning In Optimization) Conference, pages to appear, Trento, Italy, Lecture Notes In Computer Science , 2009. www 

PhD Theses

  1. Porumbel, D. C. Algorithmes Heuristiques et Techniques d'Apprentissage - Applications au Probleme de Coloration de Graphe. Ph.D. Thesis, Université d'Angers, 2009.
  1. Porumbel, D. C. Algorithmes Heuristiques et Techniques d'Apprentissage : Applications au Problème de Coloration de Graphe. Ph.D. Thesis, Université d'Angers, 2009.

2008

Conference Articles

  1. Porumbel, D. C.; Kao-Hao, J. and Kuntz, P. Recherche tabou renforcée pour la coloration de graphes. In 9ème conf. de la Société Franc caise de Recherche Opérationnelle et d'Aide `a la Décision (ROADEF), Clermont-Ferrand, France, 2008. www 

2007

Conference Articles

  1. Porumbel, D. C.; Hao, J-K. and Kuntz, P. A study of evaluation functions for the graph K-coloring problem. In Artificial Evolution, pages 124-135, Tours, France, Lecture Notes In Computer Science 4926, 2007. doi  www 
Top