Sciweavers

29 search results - page 3 / 6
» 4or 2007
Sort
View
4OR
2004
43views more  4OR 2004»
13 years 5 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
2007
99views more  4OR 2007»
13 years 6 months ago
Combinatorial optimization problems in wireless switch design
The purpose of this paper is to illustrate the diversity of combinatorial problems encountered in the design of wireless switching systems. This is done via a representative selec...
Renaud Sirdey
4OR
2005
71views more  4OR 2005»
13 years 5 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
4OR
2005
51views more  4OR 2005»
13 years 5 months ago
Sensitivity of trust-region algorithms to their parameters
Abstract In this paper, we examine the sensitivity of trust-region algorithms on the parameters related to the step acceptance and update of the trust region. We show, in the conte...
Nicholas I. M. Gould, Dominique Orban, Annick Sart...
4OR
2007
103views more  4OR 2007»
13 years 6 months ago
Compact linearization for binary quadratic problems
Abstract We show that a well-known linearization technique initially proposed for quadratic assignment problems can be generalized to a broader class of quadratic 0-1 mixed-integer...
Leo Liberti