<p> Given a graph <i>G=(V,E)</i> with strictly positive integer weights <img src="/cgi-bin/mimetex.cgi?\omega_i"> on the vertices <img src="/cgi-bin/mimete...

This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too c...

A weighted multivariate signed-rank test is introduced for an analysis of multivariate clustered data. Observations in different clusters may then get diffe...

With the help of the AutoGraphiX system, we study relations of the form

<img src="/cgi-bin/mimetex.cgi?\underline{b}m \le i1(G) \oplus i_2(G) \le \overl...

In this paper, we propose a tree-based method for multivariate outcomes consisting in a mixture of categorical and continuous responses. The split function...

In this paper, we consider the nonparametric Behrens-Fisher problem with cluster correlated data. A class of weighted Mann-Whitney test statistics are intr...

Cet article dresse un portrait de l'état de la concurrence fiscale internationale par l'entremise i) de l'étude des taux d'impôt et autres caractéristiques...

This study examines simultaneously the effect of personal, contextual, and product-related factors on purchasing behaviour of fair-trade products. The resu...

Given a graph <img src="/cgi-bin/mimetex.cgi?G=(V,E)"> with strictly positive integer weights <img src="/cgi-bin/mimetex.cgi?\omega_i"> on the vertices <img ...

Tree-based methods are frequently used in studies with censored survival time. Their structure and ease of interpretability make them useful to identify p...

Main methods, algorithms and applications of the Variable Neighborhood Search metaheuristic are surveyed, in view of a chapter of the <i>Encyclopedia of Opti...

To the best of our knowledge, the complexity of minimum sum-of-squares clustering is unknown. Yet, it has often been stated that this problem is NP-hard. We...

In this paper we study the Capacitated Team Orienteering and Profitable Tour Problems (CTOP and CPTP). The interest in these problems comes from recent devel...

We consider the bandwidth coloring problem, a generalization of the well-known graph coloring problem. For the latter problem, a classical theorem, discover...

An edge coloring of a graph <img src="/cgi-bin/mimetex.cgi?G = (V,E)"> is a function <img src="/cgi-bin/mimetex.cgi?c:E \rightarrow N"> that assigns a co...

In this paper, we consider the problem of constructing confidence intervals for a population median when the underlying population is discrete. We describe ...

We consider the problem of assigning patients to nurses for home care services. The aim is to balance the workload of the nurses while avoiding long travels...

The probabilistic satisfiability problem is to verify the consistency of a set of probability values or intervals for logical propositions. The (tight) prob...

In this paper, we propose efficient algorithms to extract minimal unsatisfiable subsets of clauses or variables in unsatisfiable propositional formulas. Suc...

We consider the problem of determining the size of a maximum clique in a graph, also known as the clique number. Given any method that computes an upper bou...