Sciweavers

11 search results - page 1 / 3
» 4or 2004
Sort
View
4OR
2004
61views more  4OR 2004»
13 years 11 months ago
Antiwebs are rank-perfect
Annegret Wagler
4OR
2004
84views more  4OR 2004»
13 years 11 months ago
Non-classical preference models in combinatorial problems: Models and algorithms for graphs
This is a summary of the most important results presented in the author's PhD thesis (Spanjaard, 2003). This thesis, written in French, was defended on 16 December 2003 and su...
Olivier Spanjaard
4OR
2004
43views more  4OR 2004»
13 years 11 months ago
Concordant outranking with multiple criteria of ordinal significance
Abstract In this paper we address the problem of aggregating outranking statements from multiple preference criteria of ordinal significance. The concept of ordinal concordance of ...
Raymond Bisdorff
4OR
2005
71views more  4OR 2005»
13 years 11 months ago
On rank-perfect subclasses of near-bipartite graphs
Shepherd (1995) proved that the stable set polytopes of near-bipartite graphs are given by constraints associated with the complete join of antiwebs only. For antiwebs, the facet s...
Annegret Wagler