Given a graph <i>G</i> with <i>n</i> vertices and stability number <img src="alpha.gif" align=bottom>(<i>G</i>), Turán's theorem gives a lower bound on the ...

An important aspect of railway planning concerns the distribution of locomotives and cars in the network and their assignment to the scheduled trains. In th...

Dans le cadre du projet de recherche franco-québécois "COPRAIC": COnception et PRoduction Accélérées dans un contexte d'Ingénierie Concourante, une enquête ...

This paper considers the placement of components onto printed circuit boards (PCB's) using surface mount technology. Multiple automatic placement machines, ...

Cet article décrit un problème d'horaires mensuels personnalisés pour les membres d'équipage (pilotes et officiers) en transport aérien. Ce problème consist...

Dans le cadre du projet de recherche franco-québécois "COPRAIC": COnception et PRoduction Accélérées dans un contexte de l'Ingénierie Concourante, une enquê...

We consider Nash equilibria as correlated equilibria and apply polyhedral theory to study extreme Nash equilibrium properties. We obtain an alternate proof ...

This paper considers the shortest path problem with waiting costs (SPWC) as an extension of the shortest path problem with time windows. The problem consis...

In recent years, there have been several important algorithmic developments for the traveling salesman problem and the vehicle routing problem. These incl...

One of the many problems faced by rail transportation companies is to optimize the utilization of the available stock of locomotives and cars. In this paper...

The aim of this paper is to present a survey of recent optimization models for the most commonly studied rail transportation problems. For each group of pro...

Column generation is often used to solve large scale optimization problems, and much research has been devoted to improve the convergence of the solution pr...

The paper deals with a problem of determining optimal advertising expenditures in a two-member channel of distribution in which the manufacturer invests in ...

A new algorithm, which exploits information from both ends of the network, is presented for the bicriterion shortest path problem. The algorithm extends eff...

Cet article identifie pour chaque fonction logistique les décisions à prendre et propose une séquence organisée de façon à constituer un processus décisionn...

A new algorithm, based on interval analysis, is proposed for global optimization of constrained nonlinear nonconvex functions of several variables. It expl...

This study investigates a new phenomenon of degeneracy in the multi-source Weber problem. This phenomenon relates to the existence of solutions in which one...

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

This paper addresses the problem of generating valid crew pairings in the context of a regional air carrier. The classical column generation solution appro...

Chopping a graph <i>G</i> means removing one edge from each connected component of <i>G</i> in parallel, and repeating this until no edges remain. The requi...