Axis 2: Decision support made in complex systems
BackCahiers du GERAD
1415 results — page 43 of 71
We recall the use of squared slacks used to transform inequality constraints into equalities and several reasons why their introduction may be harmful in ...
BibTeX reference
In the <i>Vehicle Routing Problem </i> (VRP), the aim is to design a set of <i>m</i> minimum cost vehicle routes through <i>n</i> customer locations, so that...
BibTeX reference
<p>The paper determines optimal pricing and advertising policies for an entertainment event, taking into account diffusion effects and a last-minute market...
BibTeX reference
<p>On étudie à l'aide du système AutoGraphiX 2 (AGX 2) des relations de la forme </p>
<p><center> <img src="/cgi-bin/mimetex.cgi?\underline{b}_{n} \, \l...
BibTeX referenceVariable Neighborhood Search Methods
Main methods, algorithms and applications of the Variable Neighborhood Search metaheuristic are surveyed, in view of a chapter of the <i>Encyclopedia of Opti...
BibTeX reference
In previous work, the generalized pattern search (GPS) algorithm for linearly constrained (continuous) optimization was extended to mixed variable problems...
BibTeX reference
Given a class of graphs <img src="/cgi-bin/mimetex.cgi?\mathcal{F}">, a forbidden subgraph characterization (FSC) is a set of graphs <img src="/cgi-bin/mimet...
BibTeX referenceVariable Neighborhood Search for Extremal Graphs. 25. Products of Connectivity and Distance Measures
Upper bounds for products of four measures of distances in graphs: diameter, radius, average eccentricity and remoteness with three measures of connectivity:...
BibTeX reference
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 ...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference
Data clustering methods have been developed extensively in the data mining literature for detecting useful patterns in large datasets in the form of dense...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference
We propose a new algorithm for general constrained derivative-free optimization. As in most methods, constraint violations are aggregated into a single con...
BibTeX referenceFeedback 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...
BibTeX reference
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"...
BibTeX reference
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...
BibTeX referenceNonsmooth 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...
BibTeX reference