Daniel Porumbel
Maître de conférences
Équipe : Optimisation combinatoire
Site web : http://cedric.cnam.fr/~porumbed
Bureau : 31.1.76
2024
Non publié
- Using quadratic cuts to iteratively strengthen convexifications of box quadratic programs. , working paper or preprint. www
2023
Articles de conférence
- Sous-estimateurs Quadratiques convexes par morceaux pour les problèmes d'optimisation quadratique. In 24ème congrès annuel ROADEF, Rennes, France, 2023. www
- 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
Articles de revue
- Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems. In INFORMS Journal on Computing, 2022. doi www
Articles de conférence
- 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
- Is there any O(2 n ) algorithm your OS can run in almost no time ?. In ROADEF 2022, Lyon, France, 2022. www
- Projective Cutting Planes with multiple cuts per iteration for robust linear programming. In PGMO Days 2022, Palaiseau (91), France, 2022. www
- 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
Articles de conférence
- 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
Articles de revue
- Distance-guided local search. In Journal of Heuristics, 26 (5): 711-741, 2020. doi www
- Projective Cutting-Planes. In SIAM Journal on Optimization, 30 (1): 1007-1032, 2020. doi www
Articles de conférence
- Demystifying the characterization of SDP matrices in mathematical programming. In ROADEF 2020, Montpelier, France, 2020. www
- On the importance (in Operations Research) of the techniques that can make programming (withcplexorgurobi) easier. In ROADEF 2020, Montpelier, France, 2020. www
2019
Articles de conférence
- 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
- 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
Articles de revue
- 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
- The capacitated vehicle routing problem with evidential demands. In International Journal of Approximate Reasoning, 95: 124-151, 2018. doi www
- Prize-collecting set multicovering with submodular pricing. In International Transactions in Operational Research, 25 (4): 1221-1239, 2018. doi www
Articles de conférence
- 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
Articles de revue
- Convergent Dual Bounds Using an Aggregation of Set-Covering Constraints for Capacitated Problems. In INFORMS Journal on Computing, 29 (1): 15, 2017. doi www
- 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
Articles de conférence
- 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
- 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
Articles de revue
- 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
Articles de conférence
- 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
- 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
- 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
2015
Articles de revue
- Using dual feasible functions to construct fast lower bounds for routing and location problems. In Discrete Applied Mathematics, 196: 83-99, 2015. doi www
2013
Articles de revue
- Informed Reactive Tabu Search for Graph Coloring. In Asia-Pacific Journal of Operational Research, 30 (4): 1350010, 2013. doi www
Chapitres d'ouvrage
- 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
2011
Articles de revue
- Isomorphism Testing via Polynomial-Time Graph Extensions. In Journal of Mathematical Modelling and Algorithms, 10 (2): 119-143, 2011. doi www
- A simple and effective algorithm for the MaxMin diversity problem. In Annals of Operations Research, 186 (1): 275-293, 2011. doi www
2009
Articles de conférence
- 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