Winter road maintenance operations involve a host of decision-making problems at the strategic, tactical, operational, and real-time levels. Those operations...

This article reviews some of the best metaheuristics proposed in recent years for the Vehicle Routing Problem. These are based on local search, on populatio...

The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most...

The problem of determining a shortest loop incident to each cell of a block layout is considered. A compact formulation is developed for this problem and a ...

Conjectures in graph theory have multiple forms and involve graph invariants, graph classes, subgraphs, minors and other concepts in premisses and/or conclu...

Computer-assisted and automated conjecture-making in graph theory is reviewed, focusing on the three operational systems GRAPH, Graffiti and AutoGraphiX (AGX...

We consider the multiple depot vehicle scheduling problem (MDVSP) and propose a branch-and-bound algorithm for solving it that combines column generation, va...

Our research examines a permit trading system where all countries participate to achieve a long-term greenhouse gases (GHG) stabilization target. Our main ob...

We consider a game where players face environmental constraints. We derive and compare noncooperative, cooperative and umbrella scenarios. In the latter, the...

We describe an application of Variable Neighbourhood Search (VNS)methodology to continuous global optimization problems with box constraints. A general VNS a...

This paper presents an overview of the modeling approaches that are used to represent, understand and control the interactions between the economy of a regio...

Allocution donnée par le professeur Georges Zaccour à la Société Royale du Canada, le vendredi 23 avril 2004, à HEC Montréal.

In the present paper we review the method of augmenting graphs, which is a general approach to solve the maximum independent set problem. Our objective is th...

The problem retained for the ROADEF'2001 international challenge was a frequency assignment problem with polarization constraints (FAPP). This NP-hard probl...

We consider a two-player infinite-horizon discrete-time game where the players invest in R&D in order to develop a new technology to reduce production costs....

<i>Tabucol</i>&nbsp; is a tabu search algorithm that tries to determine whether the vertices of a given graph can be colored with a &#64257;xed number <i>k</...

This paper discusses a Bayesian functional estimation method, based on Fourier series, for the estimation of the hazard rate from randomly right-censored dat...

Two ways for bounding <i>n</i>-variables functions over a box, based on interval evalu- ations of first order derivatives, are compared. The optimal Baumann...

In this paper, we study the Pitman asymptotic efficiencies of the sign and the Wilcoxon signed-rank tests for cluster correlated data. A general expression ...

This paper presents algorithms to find vertex-critical and edge-critical subgraphs in a given graph <i>G</i>, and demonstrates how these critical subgraphs ...