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 ...
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...
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...
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...
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...