OR and the management of electronic services - EURO'2004

in European Journal of Operational Research (2008), 187(3), 1293-1295

R UBIS: A bipolar-valued outranking method for the choice problem

in 4OR: a quarterly journal of operations research (2008), 6(2), 143-165

Disaggregation of bipolar-valued outranking relations and application to the inference of model parameters

Scientific Conference (2007, September)

On maximal independent sets in circulant digraphs

E-print/Working paper (2007)

In this research note we introduce St-Nicolas graphs, i.e. circulant digraphs showing exactly n maximal independent sets, isomorph under the digraph’s automorphisms group. This class of digraphs represent ... [more ▼]

In this research note we introduce St-Nicolas graphs, i.e. circulant digraphs showing exactly n maximal independent sets, isomorph under the digraph’s automorphisms group. This class of digraphs represent a generalisation of Andrásfai graphs with interesting links to finite group theory. [less ▲]

Counting non-isomorphic maximal independent sets of the n-cycle graph

Scientific Conference (2007, January)

It is known that the number of maximal independent sets of the $n$-cycle graph $C_n$ is given by the $n$th term of the Perrin sequence. The action of the automorphism group of $C_n$ on the family of these ... [more ▼]

It is known that the number of maximal independent sets of the $n$-cycle graph $C_n$ is given by the $n$th term of the Perrin sequence. The action of the automorphism group of $C_n$ on the family of these maximal independent sets partitions this family into disjoint orbits, which represent the non-isomorphic (i.e., defined up to a rotation and a reflection) maximal independent sets. We provide exact formulas for the total number of orbits and the number of orbits having a given number of isomorphic representatives. We also provide exact formulas for the total number of unlabelled (i.e., defined up to a rotation) maximal independent sets and the number of unlabelled maximal independent sets having a given number of isomorphic representatives. It turns out that these formulas involve both Perrin and Padovan sequences. [less ▲]

On enumerating the kernels in a bipolar-valued digraph

in Annales du LAMSADE (2006), 6

In this paper we would like to thoroughly cover the problem of computing all kernels, i.e. minimal outranking and/or outranked independent choices in a bipolar- valued outranking digraph. First we ... [more ▼]

In this paper we would like to thoroughly cover the problem of computing all kernels, i.e. minimal outranking and/or outranked independent choices in a bipolar- valued outranking digraph. First we introduce in detail the concept of bipolar-valued characterisation of outranking digraphs, choices and kernels. In a second section we present and discuss several algorithms for enumerating the kernels in a crisp digraph. A third section will be concerned with extending these algorithms to bipolar-valued outranking digraphs. [less ▲]

Exploitation en problématique du choix d'une relation de surclassement valuée

Presentation (2005, October 11)

The presentation discusses the use of the digraph kernels for computing a best choice recommendation from a valued outranking digraph. The classical best decision problem approach is critically reviewed ... [more ▼]

The presentation discusses the use of the digraph kernels for computing a best choice recommendation from a valued outranking digraph. The classical best decision problem approach is critically reviewed. New practical principles underlying a best choice recommendation are introduced which promote the outranking kernels as candidates for best choice recommendations. Some illustrative applications were eventually shown in order to convince the audience. [less ▲]

Preference aggregation with multiple criteria of ordinal significance

in Annales du LAMSADE (2004), 3

In this paper we address the problem of aggregating outranking situations in the presence of multiple preference criteria of ordinal significance. The concept of ordinal concordance of the global ... [more ▼]

In this paper we address the problem of aggregating outranking situations in the presence of multiple preference criteria of ordinal significance. The concept of ordinal concordance of the global outranking relation is defined and an operational test for its presence is developed. Finally, we propose a new kind of robustness analysis for global outranking relations taking into account classical dominance, ordinal and classical majority oncordance in a same bipolar-valued logical framework [less ▲]

Choice procedures in pairwise comparison multiple-attribute decision making methods

in Lecture Notes in Computer Science (2004), 3051

Design and Implementation of Decision Making Checkers for Industrial Production Scheduling, Control, and Maintenance

Doctoral thesis (2002)