## Membres

publié le , mis à jour le

retour a la liste des membres

## Daniel Vanderpooten

Tel : 01 44 05 43 93
Bureau : P409 ter
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 HAL

27 A biobjective branch and bound procedure for planning spatial missions (, and ), In Aerospace Science and Technology, Elsevier, volume 73, .

26 Covers and approximations in multiobjective optimization (, and ), In Journal of Global Optimization, volume 67, .

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

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

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

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

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

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

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

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

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

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), .

15 Biobjective planning of an active debris removal mission (, and ), In Acta Astronautica, volume 84, .

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

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

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

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

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, .

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

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

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

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

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

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

3 Complexity of the satisfactory partition problem (, and ), .

2 Decomposition of graphs: some polynomial cases (, and ), .

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