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...

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...

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...

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...

<p> We consider an infinite-horizon differential game played by two direct marketers. Each player controls the number of emails sent to potential customers...

In this paper, we consider scheduling problems on a single machine in a sequence dependent setup environment. We introduce for these problems several integer...

This paper considers large shift scheduling problems with different shift start times and lengths, fractionable breaks and work stretch duration restrictions...

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...

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...

The objective of the project is to provide dynamic scheduling solutions to two different services, automobile dealerships and dental clinics, in order to hel...

A conjecture of Delorme, Favaron and Rautenbach [DM 257 (2002) 29-38] about the Randic index of a graph, in relation to its order and minimum degree, is ref...

<p>Le système <i>AutoGraphiX (AGX1 et AGX2)</i> permet, parmi d’autres fonctions, la génération automatique de conjectures en théorie des graphes. Nous étud...

<p>Using the <i>AutoGraphiX 2</i> system, a systematic study is made on generation and proof of relations of the form</p> <center> $\underline{b}_n \leq ...

We consider two (0,1)-linear programming formulations of the graph (vertex-) coloring problem, in which variables are associated to stable sets of the input...

Ce document valide le cadre conceptuel de logistique inverse de Lambert et Riopel (2004) à l'aide de trois cas industriels d'entreprises oeuvrant dans diffé...

This paper presents a general mixed-norm minisum problem for locating a single facility in continuous space. It is assumed that several transportation modes...

The Team Orienteering Problem (TOP) is the generalization to the case of mul- tiple tours of the Orienteering Problem, known also as Selective Traveling Sal...

Earth observation satellites are platforms equipped with optical instruments that orbit the Earth in order to take photographs of specific areas at the requ...

Given the sets of flights and aircraft of an airline carrier, the fleet assignment problem consists of assigning the most profitable aircraft type to each f...

The paper examines shelf-space allocation and pricing decisions in the marketing channel as the results of a static game played à la Stackelberg between two...