A set of vertices <i>S</i> in a graph <i>G</i> is independent if no neighbor of a vertex of <i>S</i> belongs to <i>S</i>. The independence number &alpha is ...

Given a set of timetabled tasks, the multi-depot vehicle scheduling problem is a wellknown problem that consists of determining least-cost schedules for veh...

We consider four conjectures related to the largest eigenvalue of (the adjacency matrix of) a graph (i.e., to the index of the graph). Three of them have be...

The problem retained for the ROADEF’99 international challenge was an inventory management problem for a car rental company. It consists in managing a given...

Let &nbsp;<img src="/cgi-bin/mimetex.cgi?G=(V,E)">&nbsp; be a simple graph with vertex degrees &nbsp;<img src="/cgi-bin/mimetex.cgi?d1, d2, \ldots, d_n...

This paper argues that the literature applying differential games in economics and management science has aimed to a large extent for analytical results. On...

In this survey, a classification of twenty-seven Asymmetric Traveling Salesman Problem (ATSP) formulations is presented. The strength of their LP relaxation...

The vehicle routing problem with time windows consists of delivering goods at minimum cost to a set of customers using an unlimited number of capacitated ve...

Let &nbsp;<img src="/cgi-bin/mimetex.cgi?G=(V,E)"> be a simple graph with &nbsp;<img src="/cgi-bin/mimetex.cgi?n=|V|"> vertices and &nbsp;<img src="/cgi-bin/...

Given a simple connected graph <i>G = (V,E)</i> the geodetic closure <i>I&nbsp;[S]</i> <img src="/cgi-bin/mimetex.cgi?\subset"> <i>V</i> of a subset <i>S</i...

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

We consider a dynamic marketing channel involving one manufacturer and one retailer. The strategic variables of the former are the wholesale price and the a...

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