The p-dispersion problem is efficiently solvable in polynomial time in a 2d Pareto Front - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

The p-dispersion problem is efficiently solvable in polynomial time in a 2d Pareto Front

Fichier non déposé

Dates et versions

hal-02463237 , version 1 (31-01-2020)

Identifiants

  • HAL Id : hal-02463237 , version 1

Citer

Nicolas Dupin. The p-dispersion problem is efficiently solvable in polynomial time in a 2d Pareto Front. MOPGP'2019 Int. Conference on Multiple Objective Programming and Goal Programming, Oct 2019, Marrakech, Morocco. ⟨hal-02463237⟩
20 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More