Axis 2: Decision support made in complex systems
BackCahiers du GERAD
1423 results — page 46 of 72
This paper considers the swapping problem on a tree. In this problem at most one object of some type is available at each vertex, and each vertex also reque...
BibTeX referenceThe Jackknife Revisited: Feature Selection in Linear Programming Approaches to Credit Scoring
We discuss feature selection approaches within the context of linear programming models for discrimination, with special emphasis on a new interpretation an...
BibTeX reference
We propose a game-theoretic model involving the manufacturer of a national brand and a retailer selling her private label along with the national brand. The...
BibTeX referenceAdvertising an Event
<p>The paper considers a problem of how to minimize advertising costs to sell seats for a particular event, for instance, a sports game, a rock concert or a...
BibTeX reference
The AutoGraphiX research program led to a new type of application of metaheuristics in graph theory, <i>i.e.</i>, finding conjectures on graph invariants by...
BibTeX referenceVariable Neighborhood Search for Extremal Graphs. 18. Conjectures and Results about the Randic Index
Using the AutoGraphiX 2 system (AGX2), we study relations between graph invariants of the form <img src="/cgi-bin/mimetex.cgi?lbn \leq R \oplus i \leq ub...
BibTeX reference
Colour image quantization is a data compression technique that reduces the total set of colours in an image to a representative subset. This problem is expr...
BibTeX reference
In the integrated aircraft routing, crew scheduling and flight retiming problem, a minimum-cost set of aircraft routes and crew pairings must be constructed...
BibTeX reference
This paper shows that the important result obtained in a static marketing channel, namely, that the manufacturer can coordinate the channel through a two-pa...
BibTeX referenceCompetitive Emailing
<p> We consider an infinite-horizon differential game played by two direct marketers. Each player controls the number of emails sent to potential customers...
BibTeX reference
In this paper, we consider scheduling problems on a single machine in a sequence dependent setup environment. We introduce for these problems several integer...
BibTeX reference
In this paper, we study the problem of determining the capacity requirements for applications that require QoS guarantees. We consider three kinds of source ...
BibTeX reference
This work shows how disjunctive cuts can be generated for a bilevel linear programming problem (<i>BLP</i>) with continuous variables. First, a brief summar...
BibTeX reference
Given buses of different types arriving at a depot during the evening, the bus parking problem consists of assigning these buses to parking slots in such a w...
BibTeX reference
We consider two overlapping generations that want to coordinate their strategies of working, consuming and controlling pollution. As the cooperative solution...
BibTeX reference
In this paper, we model a two-period electricity market with interrelated demand, where oligopolistic generators make investments in peak- and base-load capa...
BibTeX reference
This paper considers large shift scheduling problems with different shift start times and lengths, fractionable breaks and work stretch duration restrictions...
BibTeX reference
We address a multi-objective version of the car sequencing problem, which consists in sequencing a given set of cars to be produced in a single day, minimizi...
BibTeX reference
We consider the problem of locating a circle with respect to existing facilities on the plane, such that the largest weighted distance between the circle and...
BibTeX referenceExtremal Problems for Convex Polygons
Consider a convex polygon <i>V<sub>n</sub></i> with <i>n</i> sides, perimeter <i>P<sub>n</sub></i>, diameter <i>D<sub>n</sub></i>, area <i>A<sub>n</sub></i>,...
BibTeX reference