Corrected Miller-Tucker-Zemlin type subtour elimination constraints for the Capacitated Vehicle Routing Problem are presented.

We present an exact algorithm and three applications of nonconvex quadratically constrained quadratic programming. First, we consider the pooling problem fro...

In this article, we optimally solve an integrated production and material handling scheduling problem. Traditionally, scheduling problems consider machines a...

We develop and analyze parallelization strategies for the Variable Neighborhood Search (VNS) meta-heuristic applied to the <i>p</i>-median problem. The stra...

Albertson (1997) defines the <i>imbalance</i> of an edge (<i>i,j</i>) in <i>E</i> of a graph <i>G</i> = (<i>V,E</i>) as | <i>d_i - d_j</...

The paper analyzes a differential game model of a two-member marketing channel. A manufacturer invests in national advertising with the purpose of improving ...

Le texte qui suit est l'allocution donnée par le professeur Jacques Desrosiers à la Société Royale du Canada, le jeudi 14 novembre 2002, à l'Université du Qu...

This article describes a tabu search heuristic for the <i>Dial-a-Ride Problem</i> with the following characteristics. Users specify transportation requests ...

Arc routing problems (ARPs) arise naturally in several applications where streets require maintenance, or customers located along road must be serviced. The ...

We consider a new variant of constrained shortest path problem, where the constraints come from a set of forbidden paths (arc sequences) that cannot be part...

The <i>Dial-a-Ride Problem</i> (DARP) consists of designing vehicle routes and schedules for <i>n</i> users who specify pick-up and drop-off requests betwee...

In the undirected <i>Hierarchical Chinese Postman Problem</i> (HCPP), the edges of a graph are partitioned into clusters and must be serviced while respecti...

The <i>Job Sequencing and Tool Switching Problem</i> (SSP) involves optimally sequencing jobs and assigning tools to a capacitated magazine in order to mini...

Recently, Araujo and De la Pena (1998) gave bounds for the connectivity index of chemical trees as a function of this index for general trees and the ramifi...

The pooling problem, which is fundamental to the petroleum industry, describes a situation where products possessing different attribute qualities are mixed...

We prove that amongst all fullerenes the dodecahedron has maximum smallest eigenvalue (equal to -<img src="G0234-1.gif" align=middle>), followed by the thre...

We investigate the effects of retailer's myopic behavior on channel members strategies and on sales in a single-manufacturer single-retailer distribution ne...

This article considers the (1|<i>X_p</i>-medianoid problem on a network <i>N</i>=(<i>V,E</i>) with vertex and edge demands. There are already <i>p...

In the <i>Maximum Cardinality Bin Packing Problem</i>, we are given <i>m</i> bins of capacity <i>c</i> and <i>n</i> items of weights <i>w_i</i> (...

This article reviews ten of the most important tabu search heuristics for the vehicle routing problem. Some of the main tabu search features are first desc...