Nos tutelles

CNRS Dauphine PSL *

Rechercher





Accueil > PERSONNES

Membres

publié le , mis à jour le

retour a la liste des membres

Daniel Vanderpooten

Email : daniel.vanderpooten@lamsade.dauphine.fr

Tel : 01 44 05 43 93
Bureau : P409 ter
Site Personnel: http://www.lamsade.dauphine.fr/~vdp/
Pole : Aide à la décision
Status : Professeur
Domaines de Recherche : Aide à la décision, Recherche Opérationnelle, Optimisation multiobjectifs, Optimisation combinatoire, Optimisation robuste, Modélisation des préférences.

  • Membre du conseil scientifique

  • Encadrement de these de doctorat :


    • Satya Tamby : Approches génériques pour la résolution de programmes linéaires multi-objectifs en nombres entiers ( Début : 2013-09-01)
    • Sami Kaddani : Intégration de préférences expertes en optimisation multicritère ( Début : 2014-01-01)
    • Marek Cornu : Recherche Monte-Carlo multi-objectif ( Début : 2013-09-01)
    voir toutes les theses

    Publications Dblp


    Publications DFIS


    38 Covers and approximations in multiobjective optimization (, and ), In Journal of Global Optimization, volume 67, . [bibtex] [doi]

    37 Weighted sum model with partial preference information: application to Multi-Objective Optimization (, , and ), In European Journal of Operational Research, volume 260, . [bibtex] [doi]

    36 Bi-objective matchings with the triangle inequality (, , and ), In Theoretical Computer Science, volume 670, . [bibtex] [doi]

    35 Efficient computation of the search region in multi-objective optimization (, , and ), In European Journal of Operational Research, volume 260, . [bibtex] [doi]

    34 Perturbed Decomposition Algorithm applied to the multi-objective Traveling Salesman Problem (, and ), In Computers and Operations Research, volume 79, . [bibtex] [doi]

    33 Discrete representation of the non-dominated set for multi-objective optimization problems using kernels (, and ), In European Journal of Operational Research, volume 260, . [bibtex] [doi]

    32 Robust capacity expansion of a network under demand uncertainty: a bi-objective approach ( and ), In Networks, volume 68, . [bibtex] [doi]

    31 On the representation of the search region in multi-objective optimization (, and ), In European Journal of Operational Research, volume 245, . [bibtex] [pdf] [doi]

    30 A multi-objective interactive system for adaptive traffic control (, and ), In European Journal of Operational Research, volume 244, . [bibtex] [doi]

    29 Approximate Pareto sets of minimal size for multi-objective optimization problems (, and ), In Operations Research Letters, volume 43, . [bibtex] [doi]

    28 An efficient procedure for finding best compromise solutions to the multi-objective assignment problem (, and ), In Computers and Operations Research, volume 49, . [bibtex] [doi]

    27 A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size (, , and ), In Journal of Scheduling, volume 17, . [bibtex] [doi]

    26 Détermination de solutions de meilleur compromis pour les problèmes d'optimisation combinatoire multiobjectif (, and ), . [bibtex]

    25 Biobjective planning of an active debris removal mission (, and ), In Acta Astronautica, volume 84, . [bibtex] [doi]

    24 Algorithmic improvements on dynamic programming for the bi-objective \0,1\ knapsack problem (, , and ), In Computational Optimization and Applications, volume 56, . [bibtex] [doi]

    23 On the number of non-dominated points of a multicriteria optimization problem (, and ), In Discrete Applied Mathematics, volume 161, . [bibtex] [doi]

    22 Critical edges for the assignment problem : complexity and exact resolution (, and ), In Operations Research Letters, volume 41, . [bibtex] [doi]

    21 Critical edges/nodes for the minimum spanning tree problem: complexity and approximation (, and ), In Journal of Combinatorial Optimization, volume 26, . [bibtex] [doi]

    20 Complexity of determining the most vital elements for the p-median and p-center location problems (, and ), In Journal of Combinatorial Optimization, volume 25, . [bibtex] [doi]

    19 Conception d’une procédure de recherche de solutions de compromis pour le problème d’affectation multi-objectif (, and ), . [bibtex]

    18 Lexicographic α-robustness : an alternative to min-maxcriteria (, and ), In European Journal of Operational Research, volume 220, . [bibtex] [doi]

    17 Efficient determination of the k most vital edges for the minimum spanning tree problem (, and ), In Computers and Operations Research, volume 39, . [bibtex] [doi]

    16 Bernard Roy ( and ), Chapter in (Gass, Saul I., ed.), International Series in Operations Research & Management Science, . [bibtex]

    15 The lexicographic α-robust knapsack problem ( and ), In International Transactions in Operational Research, volume 18, . [bibtex] [doi]

    14 Multiobjective and multimodal adaptive traffic light control on single junctions (, , and ), In 14th International IEEE Conference on Intelligent Transportation Systems (ITSC), 2011 - proceedings, IEEE, . [bibtex]

    13 Preference-based English reverse auctions (, and ), In Artificial Intelligence, volume 175, . [bibtex] [doi]

    12 Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem (, and ), In Combinatorial Optimization and Applications 5th International Conference, COCOA 2011 (Zhu, Xuding, ed.), Springer, . [bibtex]

    11 Lexicographic α-robustness: an application to the 1-median problem (, , and ), In RAIRO, volume 44, . [bibtex] [doi]

    10 The two-machine flow-shop serial-batching scheduling problem with limited batch size (, , and ), . [bibtex]

    9 A bicriteria flow-shop scheduling problem with two serial batching machines (, , and ), In ISCO International Symposium on Combinatorial Optimization, Electronic Notes in Discrete Mathematics, . [bibtex]

    8 Satisfactory graph partition, variants, and generalizations (, and ), In European Journal of Operational Research, volume 206, . [bibtex] [doi]

    7 Complexity of determining the most vital elements for the 1-median and 1-center location problems (, and ), In Combinatorial Optimization and Combinatorial Optimization and Applications 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I (Wu, Weili, ed.), Springer, . [bibtex]

    6 General approximation schemes for min–max (regret) versions of some (pseudo-)polynomial problems (, and ), In Discrete Optimization, volume 7, . [bibtex] [doi]

    5 Introduction à l'aide multicritère à la décision (), Chapter in (Picouleau, Christophe, ed.), Dunod, . [bibtex]

    4 Solving efficiently the 0-1 multi-objective knapsack problem (, and ), In Computers and Operations Research, volume 36, . [bibtex] [doi]

    3 Implementing an efficient fptas for the 0–1 multi-objective knapsack problem (, and ), In European Journal of Operational Research, volume 198, . [bibtex] [doi]

    2 Min–max and min–max regret versions of combinatorial optimization problems: A survey (, and ), In European Journal of Operational Research, volume 197, . [bibtex] [doi]

    1 A generalized definition of rough approximations based on similarity ( and ), In IEEE Transactions on Knowledge and Data Engineering, volume 12, . [bibtex] [doi]

    Publications HAL