Cahiers du GERAD
Recherche
Liste chronologique
3237 résultats — page 61 de 162
Energy Management through Optimized Routing and Device Powering for Greener Communication Networks
Recent data confirms that the power consumption of the ICT and of the Internet itself can no longer be ignored considering the increasing pervasiveness and...
référence BibTeX
A robust multi-period model is proposed to minimize the energy consumption of IP networks, while guaranteeing the satisfaction of uncertain traffic demands. ...
référence BibTeX
Despite the growing concern for the energy consumption of the Internet, green strategies for network and traffic management cannot undermine the quality and ...
référence BibTeX
In this paper we present JNetMan, a new Java framework for rapid development of network management solutions based on SNMP (Simple Network Management Protoco...
référence BibTeX
The analysis of networks and in particular the identification of communities, or clusters, is a topic of active research with application arising in many dom...
référence BibTeXOn Characterizing Full Dimensional Weak Facets in DEA with Variable Returns to Scale Technology
The frontier of the Production Possibility Set (PPS) consists of two types of full dimensional facets; efficient and weak facets. Identification of all facet...
référence BibTeX
Since its inception, stochastic Data Envelopment Analysis (DEA) has found many applications. The approach commonly taken in stochastic DEA is via chance cons...
référence BibTeX
In this paper, we propose a multivariate random forest method for multiple responses of mixed types with missing responses. Imputation is performed for eac...
référence BibTeX
This paper considers inventory models of <i>(Q,s)</i> type with <i>Q</i> the order-quantity and <i>s</i> the order point. In general, an optimal choice of c...
référence BibTeXImproved Risk Allocation-Based Algorithm for Chance-Constrained Generation Expansion Planning
Generation Expansion Planning (GEP) with load uncertainty is modeled in this paper using chance constrained programming, and new iterative solution algorit...
référence BibTeX
In this paper, we establish closed-form formulas for key probabilistic properties of the cone-constrained optimal mean-variance strategy, in a continuous mar...
référence BibTeX
In this work, we study the goal-achieving probabilities of a multiperiod mean-variance financial strategy under a switch-when-safe stopping time rule. Th...
référence BibTeX
Aircraft maintenance planning is of critical importance to the safe and efficient operations of an airline. It is common to solve the aircraft routing and ma...
référence BibTeX
We consider a class of dynamic games played over an event tree, where the players cooperate to optimize their expected joint payoff. Assuming that the pla...
référence BibTeX
We propose a generalization of the limited-memory Cholesky factorization of Lin and Moré (1999) to the symmetric indefinite case with special interest in sym...
référence BibTeX
In this paper, we present a mixed integer programming model for solving the long-term planning problem of an underground mine. This model establishes the seq...
référence BibTeXDistance Spectra of Graphs: A Survey
In 1971, Graham and Pollack established a relationship between the number of negative eigenvalues of the distance matrix and the addressing problem in data c...
référence BibTeX
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...
référence BibTeXChromatic Scheduling
Variations and extensions of the basic vertex-colouring and edge-colouring models have been developed to deal with increasingly complex scheduling problems. ...
référence BibTeX
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...