Cahiers du GERAD
Recherche
Liste chronologique
2934 résultats — page 67 de 147
Fifty Years of Vehicle Routing
The <i>Vehicle routing Problem</i> (VRP) was introduced 50 years ago by Dantzig and Ramser under the title "The Truck Dispatching Problem". The study of the ...
référence BibTeXSurvivability and Reliability of a Composite-Star Transport Network with Disconnected Core Switches
This paper deals with the design and dimensioning of a novel survivable optical network structure, called Petaweb, that can reach a total capacity of severa...
référence BibTeX
The paper provides a survey of the literature which utilizes dynamic state-space games to formulate and analyze intertemporal, many-decision maker problems i...
référence BibTeX
Given a set of scheduled flights that must be operated by the same aircraft type, the aircraft routing problem (ARP) consists of building anonymous aircraft ...
référence BibTeX
Many time series encountered in real applications display seasonal behavior. In this paper, we consider multiplicative seasonal vectorial autoregressive movi...
référence BibTeX
Given a graph <i>G=(V,E)</i>, the first Zagreb index <i>M</i><sub>1</sub> is the sum of its vertices squared degrees and the second Zagreb index <i>M</i><sub...
référence BibTeX
We consider in this paper a duopoly competing in quantities and where firms can invest in R&D to control their emissions. We distinguish between effort carri...
référence BibTeXEfficient Simulation Model for Real-Time Fleet Management Problems in Internal Transport Systems
This paper presents an efficient approach for realistic modelling of internal transport systems. The weakness of the former methods in tracking the traffic w...
référence BibTeX
This paper presents a new generic architecture for the implementation of an intelligent simulation-based real-time control in large-scale discrete-events sys...
référence BibTeXOn a Conjecture About the Szeged Index
Khalifeh, Yousefi-Azari, Ashrafi and Wagner [European J. Combin. 30 (2009) 1149-1163] conjectured that for a connected graph <i>G</i> on <i>n</i> vertices...
référence BibTeXCore OBS Traffic Properties and Behavior
<p>Today, OCS (Optical Circuit Switching) is still the only mature technology for optical transfer, even if it suffers from its coarse granularity under dyn...
référence BibTeX
<p>In this paper, we present a scalable and agile design for next generation optical backbone networks. We assume each node to be equipped with a MultiServic...
référence BibTeX
This chapter deals with an application of stochastic control or stochastic game methods to the design of optimal timing of climate policies. In the first par...
référence BibTeX
The proximity <img src="/cgi-bin/mimetex.cgi?\pi"> of a graph <i>G</i> is the minimum average distance from a vertex of <i>G</i> to all others. Similarly, th...
référence BibTeX
Given a set of entities associated with points in Euclidean space, minimum sum-of-squares clustering (MSSC) consist in partitioning this set into clusters su...
référence BibTeX
This work analyzes constrained black box optimization in which the functions defining the problem are periodic with respect to some or all the variables. We ...
référence BibTeX
The paper revisits the advertising differential game suggested by G. Leitmann and W. E. Schmitendorf in their paper "Profit Maximization Through Advertising...
référence BibTeXPricing the CBOT T-Bonds Futures
The aim of this paper is to investigate the pricing of the Chicago Board of Trade Treasury-Bond futures. The difficulty to price it arises from its multiple ...
référence BibTeX
We propose a deterministic, discrete-time, finite-horizon oligopoly model to investigate investment and production equilibrium strategies, in a setting where...
référence BibTeX
In this paper, we study the <i>Lebesgue</i> property for convex risk measures for a class of càdlàg processes, extending previous work of Delbaen (2000) and ...
référence BibTeX