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


    Publications HAL


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

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

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

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

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

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

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

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

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

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

    16 Détermination de solutions de meilleur compromis pour les problèmes d'optimisation combinatoire multiobjectif (, and ), In Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2013), . [bibtex] [pdf]

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

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

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

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

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

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

    9 Lexicographic alpha-robustness: an alternative to min-max criteria (, and ), In European Journal of Operational Research, Elsevier, volume Vol. 220, . [bibtex] [pdf]

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

    7 The lexicographic $\alpha$-robust knapsack problem ( and ), In International Transactions in Operational Research, Wiley, volume Vol. 18, . [bibtex] [pdf] [doi]

    6 Lexicographic $\alpha$-robustness : an application to the 1-median problem (, , and ), In RAIRO - Operations Research, EDP Sciences, volume vol. 44, n\textdegree2, . [bibtex] [pdf] [doi]

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

    4 Min-max and min-max regret versions of some combinatorial optimization problems: a survey (, and ), . [bibtex] [pdf]

    3 Complexity of the satisfactory partition problem (, and ), . [bibtex] [pdf]

    2 Decomposition of graphs: some polynomial cases (, and ), . [bibtex] [pdf]

    1 Un mécanisme de négociation multicritère pour le commerce électronique (, , , and ), . [bibtex] [pdf]