Curriculum vitae

Vanderpooten Daniel

Professeur des universités
LAMSADE

daniel.vanderpootenping@lamsade.dauphinepong.fr
Tel : 01 44 05 43 93
Bureau : P 409 ter
Site web personnel

Biographie

Daniel Vanderpooten est Professeur en Informatique à l'Université Paris Dauphine et membre du Lamsade. Il est responsable du pacours de Master 2 Recherche "Modélisation, Optimisation, Décision, Organisation" (MODO). Ses domaines de recherche sont l'Aide à la Décision et la Recherche Opérationnelle, plus particulièrement l'optimisation multiobjectifs, l'optimisation combinatoire et l'optimisation robuste. Ses travaux sont à la fois théoriques et appliqués.

Dernières publications

Articles

Bazgan C., Jamain F., Vanderpooten D. (2017), Discrete representation of the non-dominated set for multi-objective optimization problems using kernels, European Journal of Operational Research, vol. 260, n°3, p. 814-827

Vanderpooten D., Weerasena L., Wiecek M. (2017), Covers and approximations in multiobjective optimization, Journal of Global Optimization, vol. 67, n°3, p. 601-619

Cornu M., Cazenave T., Vanderpooten D. (2017), Perturbed Decomposition Algorithm applied to the multi-objective Traveling Salesman Problem, Computers and Operations Research, vol. 79, p. 314-330

Kaddani S., Vanderpooten D., Vanpeperstraete J., Aissi H. (2017), Weighted sum model with partial preference information: application to Multi-Objective Optimization, European Journal of Operational Research, vol. 260, n°2, p. 665-679

Gourvès L., Monnot J., Pascual F., Vanderpooten D. (2017), Bi-objective matchings with the triangle inequality, Theoretical Computer Science, vol. 670, p. 1-10

Dächert K., Klamroth K., Lacour R., Vanderpooten D. (2017), Efficient computation of the search region in multi-objective optimization, European Journal of Operational Research, vol. 260, n°3, p. 841-855

Aissi H., Vanderpooten D. (2016), Robust capacity expansion of a network under demand uncertainty: a bi-objective approach, Networks, vol. 68, n°3, p. 185-199

Bazgan C., Jamain F., Vanderpooten D. (2015), Approximate Pareto sets of minimal size for multi-objective optimization problems, Operations Research Letters, vol. 43, n°1, p. 1-6

Klamroth K., Lacour R., Vanderpooten D. (2015), On the representation of the search region in multi-objective optimization, European Journal of Operational Research, vol. 245, n°3, p. 767-778

Dujardin Y., Vanderpooten D., Boillot F. (2015), A multi-objective interactive system for adaptive traffic control, European Journal of Operational Research, vol. 244, n°2, p. 601-610

Belhoul L., Galand L., Vanderpooten D. (2014), An efficient procedure for finding best compromise solutions to the multi-objective assignment problem, Computers and Operations Research, vol. 49, p. 97-106

Aloulou M., Bouzaiene A., Dridi N., Vanderpooten D. (2014), A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size, Journal of Scheduling, vol. 17, n°1, p. 17-29

Bazgan C., Jamain F., Vanderpooten D. (2013), On the number of non-dominated points of a multicriteria optimization problem, Discrete Applied Mathematics, vol. 161, n°18, p. 2841-2850

Bazgan C., Toubaline S., Vanderpooten D. (2013), Critical edges/nodes for the minimum spanning tree problem: complexity and approximation, Journal of Combinatorial Optimization, vol. 26, n°1, p. 178-189

Bazgan C., Toubaline S., Vanderpooten D. (2013), Critical edges for the assignment problem : complexity and exact resolution, Operations Research Letters, vol. 41, n°6, p. 685-689

Bazgan C., Toubaline S., Vanderpooten D. (2013), Complexity of determining the most vital elements for the p-median and p-center location problems, Journal of Combinatorial Optimization, vol. 25, n°2, p. 191-207

Figueira J., Paquete L., Simoes M., Vanderpooten D. (2013), Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem, Computational Optimization and Applications, vol. 56, n°1, p. 97-111

Madakat D., Morio J., Vanderpooten D. (2013), Biobjective planning of an active debris removal mission, Acta Astronautica, vol. 84, p. 182-188

Bazgan C., Toubaline S., Vanderpooten D. (2012), Efficient determination of the k most vital edges for the minimum spanning tree problem, Computers and Operations Research, vol. 39, n°11, p. 2888-2898

Kalaï R., Lamboray C., Vanderpooten D. (2012), Lexicographic α-robustness : an alternative to min-maxcriteria, European Journal of Operational Research, vol. 220, n°3, p. 722-728

Kalaï R., Vanderpooten D. (2011), The lexicographic α-robust knapsack problem, International Transactions in Operational Research, vol. 18, n°1, p. 103-113

Bellosta M-J., Kornman S., Vanderpooten D. (2011), Preference-based English reverse auctions, Artificial Intelligence, vol. 175, n°7-8, p. 1449-1467

Kalaï R., Aloulou M., Vallin P., Vanderpooten D. (2010), Lexicographic α-robustness: an application to the 1-median problem, RAIRO, vol. 44, n°2, p. 119-138

Bazgan C., Tuza Z., Vanderpooten D. (2010), Satisfactory graph partition, variants, and generalizations, European Journal of Operational Research, vol. 206, n°2, p. 271-280

Aissi H., Bazgan C., Vanderpooten D. (2010), General approximation schemes for min–max (regret) versions of some (pseudo-)polynomial problems, Discrete Optimization, vol. 7, n°3, p. 136-148

Aissi H., Bazgan C., Vanderpooten D. (2009), Min–max and min–max regret versions of combinatorial optimization problems: A survey, European Journal of Operational Research, vol. 197, n°2, p. 427-438

Bazgan C., Hugot H., Vanderpooten D. (2009), Implementing an efficient fptas for the 0–1 multi-objective knapsack problem, European Journal of Operational Research, vol. 198, n°1, p. 47-56

Bazgan C., Hugot H., Vanderpooten D. (2009), Solving efficiently the 0-1 multi-objective knapsack problem, Computers and Operations Research, vol. 36, n°1, p. 260-279

Farah M., Vanderpooten D. (2008), An outranking approach for information retrieval, Information Retrieval, vol. 11, n°4, p. 315-334

Aissi H., Bazgan C., Vanderpooten D. (2008), Complexity of the min-max (regret) versions of cut problems, Discrete Optimization, vol. 5, n°1, p. 66-73

Bazgan C., Tuza Z., Vanderpooten D. (2008), Approximation of satisfactory bisection problems, Journal of Computer and System Sciences, vol. 74, n°5, p. 875-883

Bellosta M-J., Kornman S., Vanderpooten D. (2008), A unified framework for multiple criteria auction mechanisms, Web Intelligence and Agent Systems, vol. 6, n°4, p. 401-419

Buchanan J., Vanderpooten D. (2007), Ranking projects for an electricity utility using ELECTRE III, International Transactions in Operational Research, vol. 14, n°4, p. 309-323

Bazgan C., Tuza Z., Vanderpooten D. (2007), Efficient algorithms for decomposing graphs under degree constraints, Discrete Applied Mathematics, vol. 155, n°8, p. 979-988

Kazakci A., Rozakis S., Vanderpooten D. (2007), Energy crop supply in France: a min-max regret approach, The Journal of the Operational Research Society, vol. 58, n°11, p. 1470-1479

Aissi H., Bazgan C., Vanderpooten D. (2007), Approximation of min-max and min-max regret versions of some combinatorial optimization problems, European Journal of Operational Research, vol. 179, n°2, p. 281-290

Pinson S., Bellosta M-J., Vanderpooten D., Brigui I., Kornman S. (2007), Système multi-agents pour des enchères multicritères : modèle et expérimentations, Revue d'Intelligence Artificielle, vol. 21, n°5-6, p. 703-727

Hugot H., Vanderpooten D., Vanpeperstraete J-M. (2006), A bi-criteria approach for the data association problem, Annals of Operations Research, vol. 147, n°1, p. 217-234

Bazgan C., Tuza Z., Vanderpooten D. (2006), Degree-constrained decompositions of graphs: bounded treewidth and planarity, Theoretical Computer Science, vol. 355, n°3, p. 389-395

Bazgan C., Tuza Z., Vanderpooten D. (2006), The satisfactory partition problem, Discrete Applied Mathematics, vol. 154, n°8, p. 1236-1245

Aissi H., Bazgan C., Vanderpooten D. (2005), Complexity of the min-max and min-max regret assignment problems, Operations Research Letters, vol. 33, n°6, p. 634-640

Azibi R., Vanderpooten D. (2003), Aggregation of dispersed consequences for constructing criteria: the evaluation of flood risk reduction strategies, European Journal of Operational Research, vol. 144, n°2, p. 397-411

Gabrel V., Vanderpooten D. (2002), Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an Earth observing satellite, European Journal of Operational Research, vol. 139, n°3, p. 533-542

Azibi R., Vanderpooten D. (2002), Construction of rule-based assignment models, European Journal of Operational Research, vol. 138, n°2, p. 274-293

Rozakis S., Sourie J-C., Vanderpooten D. (2001), Integrated micro-economic modelling and multi-criteria methodology to support public decision-making: the case of liquid bio-fuels in France, Biomass & Bioenergy, vol. 20, n°5, p. 385-398

Stefanowski J., Vanderpooten D. (2001), Induction of decision rules in classification and discovery-oriented perspectives, International Journal of Intelligent Systems, vol. 16, n°1, p. 13-27

Slowinski R., Vanderpooten D. (2000), A generalized definition of rough approximations based on similarity, IEEE Transactions on Knowledge and Data Engineering, vol. 12, n°2, p. 331-336

Vanderpooten D. (1989), The interactive approach in MCDA: A technical framework and some basic conceptions, Mathematical and Computer Modelling, vol. 12, n°10-11, p. 1213-1220

Vanderpooten D., Vincke P. (1989), Description and analysis of some representative interactive multicriteria procedures, Mathematical and Computer Modelling, vol. 12, n°10-11, p. 1221-1238

Chapitres d'ouvrage

Vanderpooten D., Bouyssou D. (2011), Bernard Roy, in Gass, Saul I., Profiles in Operations Research: Pioneers and Innovators, New York: International Series in Operations Research & Management Science, p. 867

Vanderpooten D. (2009), Introduction à l'aide multicritère à la décision, in Picouleau, Christophe, Précis de recherche opérationnelle : méthodes et exercices d'application, Paris: Dunod, p. 571

Communications avec actes

Bazgan C., Herzel A., Ruzika S., Thielen C., Vanderpooten D. (2019), An FPTAS for a General Class of Parametric Optimization Problems, in Ding-Zhu Du, Zhenhua Duan, Cong Tian, 25th International Conference, COCOON 2019, Springer, 25-37 p.

Bazgan C., Herzel A., Ruzika S., Thielen C., Vanderpooten D. (2019), An FPTAS for a General Class of Parametric Optimization Problems, in Ding-Zhu Du, Zhenhua Duan, Cong Tian, 25th International Conference on Computing and Combinatorics (COCOON 19), Springer, 25-37 p.

Dujardin Y., Boillot F., Vanderpooten D., Vinant P. (2011), Multiobjective and multimodal adaptive traffic light control on single junctions, in , 14th International IEEE Conference on Intelligent Transportation Systems (ITSC), 2011 - proceedings, Washington, DC, IEEE - Institute of Electrical and Electronics Engineers, 1361-1368 p.

Bazgan C., Toubaline S., Vanderpooten D. (2011), Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem, in Zhu, Xuding, Combinatorial Optimization and Applications 5th International Conference, COCOA 2011, Zhangjiajie, Springer, 126-140 p.

Bouzaiene A., Aloulou M., Dridi N., Vanderpooten D. (2010), A bicriteria flow-shop scheduling problem with two serial batching machines, in , ISCO International Symposium on Combinatorial Optimization, Hammamet, Electronic Notes in Discrete Mathematics, 1177-1184 p.

Bazgan C., Hugot H., Vanderpooten D. (2007), A practical efficient fptas for the 0-1 multi-objective knapsack problem, in Welzl, Emo, Algorithms - ESA 2007 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, Eilat, Springer, 717-728 p.

Vanderpooten D., Farah M. (2007), L'agrégation en recherche d'information : une revue critique des principaux modèles théoriques de recherche d'information, in , COnférence en Recherche d'Infomations et Applications - CORIA 2007, 4th French Information Retrieval Conference, Saint-Étienne, France, March 28-30, 2007. Proceedings, St Etienne, Université de Saint-Étienne, 125-136 p.

Bellosta M-J., Vanderpooten D., Kornman S. (2007), An Agent-Based Mechanism for Autonomous Multiple Criteria Auctions, in , International Conference on Intelligent Agent Technology, 2006. IAT '06. IEEE/WIC/ACM - Proceedings, Hong Kong, IEEE - Institute of Electrical and Electronics Engineers, 587-594 p.

Bazgan C., Hugot H., Vanderpooten D. (2007), An efficient implementation for the 0-1 multi-objective knapsack problem, in Demetrescu, Camil, Experimental Algorithms 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings, Rome, Springer, 406-419 p.

Aissi H., Bazgan C., Vanderpooten D. (2006), Approximating min-max (regret) versions of some polynomial problems, in Lee, D.T., Computing and Combinatorics 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings, Taipei, Springer, 428-438 p.

Farah M., Rosenthal-Sabroux C., Saad I., Vanderpooten D. (2006), A multicriteria framework for locating and retrieving crucial knowledge, in Carlsson, Sven, International Conference on Creativity and Innovation in Decision Making and Decision Support (CIDMDS 2006), Londres, Ludic Publishing Ltd, 757-772 p.

Bellosta M-J., Kornman S., Vanderpooten D. (2006), Un cadre général pour les enchères multicritères, in Laboratoire d'informatique (LI EA2101), Quinzième congrès francophone Reconnaissance des formes et intelligence artificielle (RFIA 2006), Tours, Presses universitaires François Rabelais, 150 p.

Kalaï R., Vanderpooten D. (2006), Lexicographic alpha-robust knapsack problems: complexity results, in , International Conference on Services Systems and Services Management (ICSSSM'06) Proceedings, Troyes, IEEE - Institute of Electrical and Electronics Engineers

Farah M., Vanderpooten D. (2006), A multiple criteria approach for Information Retrieval, in Sanderson, Mark, String Processing and Information Retrieval 13th International Conference, SPIRE 2006, Glasgow, UK, October 11-13, 2006, Proceedings, Glasgow, Springer, 367 p.

Aissi H., Vanderpooten D., Vanpeperstraete J-M. (2005), Robust approaches for the data association problem, in , 8th International Conference on Information Fusion, 2005, Philadelphie, IEEE - Institute of Electrical and Electronics Engineers, 6 p.

Bazgan C., Tuza Z., Vanderpooten D. (2005), Complexity and approximation of satisfactory partition problems, in Wang, Lusheng, Computing and Combinatorics 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-19, 2005, Proceedings, Kunming, Springer, 829-838 p.

Bellosta M-J., Kornman S., Vanderpooten D. (2005), A framework for multiple criteria English reverse auctions, in Zhong, Ning, Proceedings of the 2005 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, Compiegne, France, September 19-22, 2005, Compiègne, IEEE - Institute of Electrical and Electronics Engineers, 633-639 p.

Aissi H., Bazgan C., Vanderpooten D. (2005), Pseudo-polynomial algorithms for min-max and min-max regret problems, in Xian-Sun, Zhang, Operations Research and Its Applications. The Fifth International Symposium, ISORA’05 Tibet, China, August 8–13, 2005 Proceedings, Lhassa, World Publishing Corporation, 171-178 p.

Aissi H., Bazgan C., Vanderpooten D. (2005), Complexity of the min-max (regret) versions of cut problems, in Du, Ding-Zhu, Algorithms and Computation 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, Sanya (Hainan), Springer, 789-798 p.

Aissi H., Bazgan C., Vanderpooten D. (2005), Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack, in Leonardi, Stefano, Algorithms – ESA 2005 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, Palma de Mallorca, Springer, 862-873 p.

Bellosta M-J., Brigui I., Kornman S., Vanderpooten D. (2004), A multi-criteria model for electronic auctions, in Wainwright, Roger L., Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), Nicosia, Cyprus, March 14-17, 2004, Nicosie, ACM, 759-765 p.

Farah M., Vanderpooten D. (2004), Novel Approaches in Text Information Retrieval: Experiments in the Web Track of TREC 2004, in Voorhees, Ellen M., Proceedings of the Thirteenth Text REtrieval Conference, TREC 2004, Gaithersburg, Maryland, November 16-19, 2004, Gaithersburg, National Institute of Standards and Technology (NIST), 6 p.

Brigui I., Bellosta M-J., Kornman S., Pinson S., Vanderpooten D. (2004), Un mécanisme de négociation multicritère pour le commerce électronique, in , 14ème Congrès Francophone AFRIF-AFIA de Reconnaissance des Formes et Intelligence Artificielle, Toulouse, IRIT

Bazgan C., Tuza Z., Vanderpooten D. (2003), On the existence and determination of satisfactory partitions in a graph, in Ono, Hirotaka, Algorithms and Computation 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings, Kyoto, Springer, 444-453 p.

Communications sans actes

Jamain F., Bazgan C., Vanderpooten D. (2014), Approximation in multiobjective optimization using e-kernels, 15ème congrès annuel de la Société française de recherche opérationnelle et d’aide à la décision (ROADEF'14), Bordeaux, France

Jamain F., Bazgan C., Vanderpooten D. (2013), Approximation de taille minimale de l'ensemble de Pareto de problèmes multicritères, 14ème congrès annuel de la Société française de recherche opérationnelle et d’aide à la décision (ROADEF'13), Troyes, France

Belhoul L., Galand L., Vanderpooten D. (2013), Détermination de solutions de meilleur compromis pour les problèmes d'optimisation combinatoire multiobjectif, Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2013), Troyes, France

Jamain F., Bazgan C., Vanderpooten D. (2013), On Approximate Kernels of Minimal Size for Bicriteria Problems, 22nd International Conference on Multiple Criteria Decision Making (MCDM’13), 2013, Malaga, Espagne

Belhoul L., Galand L., Vanderpooten D. (2012), Conception d’une procédure de recherche de solutions de compromis pour le problème d’affectation multi-objectif, Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2012), Angers, France

Bazgan C., Escoffier B., Gourvès L., Monnot J., Pascual F., Vanderpooten D. (2012), Solutions équitables approchées pour divers problèmes d’optimisation combinatoire, 13ème congrès annuel de la Société française de recherche opérationnelle et d’aide à la décision (ROADEF'12), Angers, France

Jamain F., Bazgan C., Vanderpooten D. (2012), Sur le nombre de points non dominés d'un problème multicritères, 13ème congrès annuel de la Société française de recherche opérationnelle et d’aide à la décision (ROADEF'12), Angers, France

Lacour R., Vanderpooten D. (2012), Approches efficaces avec garantie a priori pour le problème de l’arbre couvrant multi-objectif, 13e Congrès ROADEF 2012, Angers, France

Bouzaiene A., Aloulou M., Dridi N., Vanderpooten D. (2010), The two-machine flow-shop serial-batching scheduling problem with limited batch size, 12th International Conference on Project Management and Scheduling (PMS 2010), Tours, France

Aloulou M., Kalaï R., Vallin P., Vanderpooten D. (2005), Robust 1-median location problem on a tree, Operational Research Peripatetic Postgraduate Programme (ORP3 2005), Valence, Espagne

Farah M., Vanderpooten D. (2005), A multicriteria paradigm of relevance for the Web Information Retrieval problem, 3rd international Conference on Sciences of Electronic, Technologies of Information and Telecommunications (SETIT 2005), Sousse, Tunisie

Prépublications / Cahiers de recherche

Vanderpooten D., Kalaï R., Aloulou M., Vallin P. (2006), Minmax regret 1-center problem on a network with a discrete set of scenarios, Paris, Cahier du LAMSADE, 13 p.

Bazgan C., Tuza Z., Vanderpooten D. (2003), Complexity of the satisfactory partition problem, Note de recherche du LAMSADE, 13 p.

Bazgan C., Tuza Z., Vanderpooten D. (2003), Decomposition of graphs: some polynomial cases, Note de recherche du LAMSADE, 11 p.

Retour à la liste