Until recently, graph coloring being a computationally difficult problem, completely dynamic channel allocation was not considered in large scale networks. T...

Credit spreads and CDS premiums are investigated before, during and after the financial crisis with a flexible credit risk model. The latter is designed to c...

There are few systematic methodologies capable of predicting and managing the potential of large populations of appliances working as aggregated reserve reso...

We consider the multivariate linear model for multilevel data where units are nested within a hierarchy of clusters. We propose permutation procedures to tes...

The Recursive Largest First (RLF) algorithm is one of the most popular greedy heuristics for the vertex coloring problem. It sequentially builds color clas...

The inventory-routing problem (IRP) integrates two well-studied problems, namely, inventory management and vehicle routing. Given a set of customers to servi...

A dynamic global hedging procedure making use of futures contracts is developed for a retailer of the electricity market facing price, load and basis risk. S...

Since its inception, stochastic Data Envelopment Analysis (DEA) has found many applications. The approach commonly taken in stochastic DEA is via chance cons...

In this paper, we propose a multivariate random forest method for multiple responses of mixed types with missing responses. Imputation is performed for eac...

In this paper we present a forecasting method for time series using copula-based models for multivariate time series. We study how the performance of the p...

Variations and extensions of the basic vertex-colouring and edge-colouring models have been developed to deal with increasingly complex scheduling problems. ...

A graph \(G = (V,E)\) is \(r\)-equitably \(k\)-colorable if there exists a partition of \(V\) into \(k\) independent sets `(V1, V2, \ldots, V_k...

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