Cahiers du GERAD
Recherche
Liste chronologique
3083 résultats — page 84 de 155
In the set of all connected graphs with a given domination number, we characterize the graphs which achieve the maximum value of the spectral radius of the ...
référence BibTeX
We show that among connected graphs with maximum clique size <img src="/cgi-bin/mimetex.cgi?\omega">, the minimum value of the spectral radius of adjacency m...
référence BibTeX
Routing for Overlapping Segment Shared Protection (OSSP) in multi-domain networks is more difficult than that in single domain networks because of the scalab...
référence BibTeX
We present and compare three new compact linearizations for the quadratic 0-1 minimization problem, two of which achieving the same lower bound than the "sta...
référence BibTeX
This paper explores the design modelling issues of the Petaweb, an optical network architecture that provides fully meshed connectivity between electronic...
référence BibTeX
Circle packing problems were recently solved via reformulation descent (RD) by switching between a cartesian and a polar formulation. Mixed formulations, wi...
référence BibTeX
Data clustering methods have been developed extensively in the data mining literature for detecting useful patterns in large datasets in the form of dense...
référence BibTeX
Les contributions récentes en économie du tourisme reconnaissent que le marché du tourisme est un marché de concurrence imparfaite qui doit être abordé du po...
référence BibTeX
The <i>Capacitated Arc Routing Problem</i> (CARP) consists of determining a set of least cost capacitated vehicle routes servicing a set of arcs. In this p...
référence BibTeX
In an Advance Booking Discount Program (ABDP), a firm offers a product at a price discount prior to the selling season. In the selling season the product i...
référence BibTeX
We propose a new algorithm for general constrained derivative-free optimization. As in most methods, constraint violations are aggregated into a single con...
référence BibTeX
The coupling-from-the-past (CFTP) algorithm of Propp and Wilson, also called perfect sampling, permits one to sample exactly from the stationary distributio...
référence BibTeX
This paper considers the class of discrete-time nonlinear Markovian jump systems. The stochastic stability and stabilization problems are tackled. A model-b...
référence BibTeXFeedback Stackelberg Equilibrium Strategies when the Private Label Competes with the National Brand
We consider a noncooperative differential game where a retailer sells her own private label in addition to the manufacturer’s brand. We assume that each bran...
référence BibTeX
A set of vertices <i>S</i> in a graph <i>G</i> is a clique if any two of its vertices are adjacent. The clique number <img src="/cgi-bin/mimetex.cgi?\omega"...
référence BibTeX
The main purpose of this paper is to study the impact of traditional and emergent environmental regulations on firms’ strategies and outcomes. The former co...
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 BibTeXNonsmooth Optimization through Mesh Adaptive Direct Search and Variable Neighborhood Search
This paper proposes a way to combine the Mesh Adaptive Direct Search (MADS) algorithm, which extends the Generalized Pattern Search (GPS) algorithm, with th...
référence BibTeXThe Role of Nuclear Energy in Long-Term Climate Scenarios: An Analysis with the World-TIMES model
<p> There is a revival in the nuclear debate observed in the literature. Most of the emission scenarios of the Intergovernmental Panel on Climate Change (I...
référence BibTeXCorouting: An IP Hybrid Routing Approach
We propose a hybrid routing scheme that combines traditional shortest-path based OSPF mechanisms as well as a new form of explicit routing executed at the ...
référence BibTeX