We review the work of B. Roy in graph theory and its posterity.

Given a set of logical sentences together with nonnegative weights assigned to each of them, the Maximum Weight Satisfiability problem (MAX-WEIGHT SAT) cons...

We modify the algorithm of Pardalos and Rodgers [40] for the minimization of a pseudo-boolean quadratic function by introducing an easy to compute lower bou...

The set of equilibrium points of a bimatrix game is the union of polytopes that are not necessarily disjoint. Knowledge of the vertices of these polytopes ...

Clique partitionning in Euclidean space <b>R</b>ⁿ consists in finding a partition of a given set of <i>N</i> points into <i>M</i> clusters in ord...

The operating schedule problem in open-pit mine can be associated with the problem of maximal closure on a graph. In the literature, the Lagrangian relaxati...

Assigning locomotives and cars to a set of scheduled trains is a complex but important problem for passenger railways. This task is normally carried out in ...

We present a fast tabu search method for the design of access tree networks. We connect a population of users to a set of switches using a variety of SONET ...

Le problème de plus court chemin avec contraintes de ressources consiste à trouver un chemin d'un point origine à un point destination de coût minimum et re...

We propose a network design model for flat networks using hybrid optical/electronic equipments. We describe a set of network components that can be taken in...

Cet article de vulgarisation donne un bref aperçu des travaux réalisés en gestion des opérations dans les grands réseaux de transport. On y fait principalem...

Given a set of flight legs to be flown by a single type of aircraft, the simultaneous aircraft routing and crew scheduling problem consists of determining a...

Let <i>G</i> be a multigraph containing no minor isomorphic to <i>K</i>_3,3 or <i>K</i>₅<i>e</i> (where <i>K</i>₅<i>e</i> de...

The standard way to solve the static economic dispatch problem with transmission losses is the penalty factor method. The problem is solved iteratively by a...

In several arc routing problems, it is necessary to take turn penalties into account when designing a solution. Traditionally, this is done through a trans...

Systematic change of neighborhood within a possibly randomized local search algorithm yields a simple and effective metaheuristic for combinatorial and glo...

This paper examines dynamic advertising and promotion strategies in a marketing channel where the retailer promotes the manufacturer's product, and the manu...

Weber's problem is to locate a facility in the Euclidean plane in order to minimize total transportation costs from that facility to a given set of users wi...

This paper presents a survey on the <i>Vehicle Routing Problem with Pickup and Delivery</i> in which a heterogeneous vehicle fleet based at multiple termina...

A model for the optimal location of new facilities in a competitive market is introduced under the hypothesis that customers' behavior can be modeled by ran...