Axe 1 : Valorisation des données pour la prise de décision
RetourCahiers du GERAD
431 résultats — page 14 de 22
A weighted multivariate signed-rank test is introduced for an analysis of multivariate clustered data. Observations in different clusters may then get diffe...
référence BibTeX
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...
référence BibTeXMultivariate Mixed Decision Trees
In this paper, we propose a tree-based method for multivariate outcomes consisting in a mixture of categorical and continuous responses. The split function...
référence BibTeX
In this paper, we consider the nonparametric Behrens-Fisher problem with cluster correlated data. A class of weighted Mann-Whitney test statistics are intr...
référence BibTeX
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...
référence BibTeX
This study examines simultaneously the effect of personal, contextual, and product-related factors on purchasing behaviour of fair-trade products. The resu...
référence BibTeXOn a Reduction of the Interval Coloring Problem to a Series of Bandwidth Coloring Problems
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 ...
référence BibTeXDiscrete-Time Survival Trees
Tree-based methods are frequently used in studies with censored survival time. Their structure and ease of interpretability make them useful to identify p...
référence BibTeXVariable Neighborhood Search Methods
Main methods, algorithms and applications of the Variable Neighborhood Search metaheuristic are surveyed, in view of a chapter of the <i>Encyclopedia of Opti...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
We consider the bandwidth coloring problem, a generalization of the well-known graph coloring problem. For the latter problem, a classical theorem, discover...
référence BibTeX
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...
référence BibTeX
In this paper, we consider the problem of constructing confidence intervals for a population median when the underlying population is discrete. We describe ...
référence BibTeX
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...
référence BibTeX
The probabilistic satisfiability problem is to verify the consistency of a set of probability values or intervals for logical propositions. The (tight) prob...
référence BibTeXUsing Meta-Heuristics to Find Minimal Unsatisfiable Subformulas in Satisfiability Problems
In this paper, we propose efficient algorithms to extract minimal unsatisfiable subsets of clauses or variables in unsatisfiable propositional formulas. Suc...
référence BibTeX
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...
référence BibTeX
In this paper, we consider testing the location parameter with multilevel (or hierarchical) data. A general family of weighted test statistics are introduced...
référence BibTeXVariable Space Search for Graph Coloring
Let <i>G = (V,E)</i> be a graph with vertex set <i>V</i> and edge set <i>E</i>. The <i>k</i>-coloring problem is to assign a color (a number chosen in {1,.....
référence BibTeX