We study the number ${\cal{P}}(G)$ of non-equivalent ways of coloring a given graph $G$. We show some similarities and differences between this graph...

In this paper a new procedure for finding an upper bound on the clique number of a given graph is described. Gendron, Hertz and St-Louis (2008) proposed a se...

Given a directed graph with weights on the vertices and on the arcs, a &theta;-improper <i>k</i>-coloring is an assignment of at most <i>k</i> different colo...

Given a graph <i>G</i>, an integer <i>k</i>, and a cost <i>c_uv</i> associated with all pairs <i>uv</i> of non-adjacent vertices in <i>G</i>, the ...

The BIRCH algorithm (Balanced Iterative Reducing and Clustering Hierarchies) handles massive dataset by reading the data file only once, clustering the data ...

Application of the dispersion models in order to address the cannibalization phenomenon within franchised chains is a new approach. In this work we have deve...

This paper presents a framework in which many structural credit risk models can be made hybrid by randomizing the default trigger, while keeping the capita...

In this paper, we derive and empirically test a regime-shifting dynamic term structure model for pricing interest rate caps. The central state variables are...

This paper develops a dynamic risk management model to determine a firm's optimal risk management strategy. This strategy has two elements: first, for low ...

In this article we study a network design problem that arises in the exploitation of wind energy. We formulate this problem as a mixed integer programming ...

Our main interest is the prediction of future events for recurrent event processes. We intend to build a Bayesian model, based on sound philosophical princip...

It is shown that parametric bootstrap can be used for computing P-values of goodness-of-fit tests of multivariate time series parametric models. These mo...

In a recent paper, Zhan, Zhang, Guan, and Zhou [Phys. Rev. E <b>83</b>, 066120 (2011)] presented a modified adaptive genetic algorithm (MAGA) tailored to the...

Finding communities, or clusters, in networks, or graphs, has been the subject of intense studies in the last ten years. The most used criterion for that pu...

The sophisticated and automated means of data collection used by an increasing number of institutions and companies leads to extremely large datasets. Sub...

Classical control charts detect when a process loses its stability, but they do not give indications on the gravity of the instability and on the risk incu...

This paper presents a non--technical account of the developments in tree--based methods for the analysis of survival data with censoring. This review desc...

An <i>r</i>-equitable <i>k</i>-coloring <i>c</i> of a graph <i>G=(V,E)</i> is a partition of <i>V</i> into <i>k</i> stable sets <img src="/cgi-bin/mimetex.cg...

We consider a cement delivery problem with an heterogeneous fleet of vehicles and several depots. The demands of the customers are typically larger than the ...

The objective in the continuous facility location problem with limited distances is to minimize the sum of distance functions from the facility to the cust...