Counting and Enumeration complexity with application to Multicriteria Scheduling - Université de Tours Accéder directement au contenu
Article Dans Une Revue Annals of Operations Research Année : 2007

Counting and Enumeration complexity with application to Multicriteria Scheduling

Résumé

In this paper we tackle an important point of combinatorial optimisation: that of complexity theory when dealing with the counting or enumeration of optimal solutions. Complexity theory has been initially designed for decision problems and evolved over the years, for instance, to tackle particular features in optimisation problems. It has also evolved, more or less recently, towards the complexity of counting and enumeration problems and several complexity classes, which we review in this paper, have emerged in the literature. This kind of problems makes sense, notably, in the case of multicriteria optimisation where the aim is often to enumerate the set of the so-called Pareto optima. In the second part of this paper we review the complexity of multicriteria scheduling problems in the light of the previous complexity results.
Fichier non déposé

Dates et versions

hal-01022118 , version 1 (10-07-2014)

Identifiants

  • HAL Id : hal-01022118 , version 1

Citer

Vincent t'Kindt, Karima Bouibede-Hocine, Carl Esswein. Counting and Enumeration complexity with application to Multicriteria Scheduling. Annals of Operations Research, 2007, 153, pp.215-234. ⟨hal-01022118⟩
29 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More