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

The paper considers a channel of distribution consisting of a single manufacturer and retailer. The manufacturer advertises in national media, to build up t...

The purpose of this article is to describe several applications of the Clustered Traveling Salesman Problem arising in areas as diverse as vehicle routing, ...

A survey is made of computer systems which help to obtain and sometimes provide automatically proofs, conjectures and refutations in graph theory.

This paper investigates several questions related to the location of facilities in multi-storey buildings in the presence of lifts. Where should facilities ...

In this paper we introduce a new formulation of the logistics network design problem encountered in deterministic, single-country, single-period contexts. O...

This paper investigates a new variation in the continuous single facility location problem. Specifically, we address the problem of locating a new facility...

We study various uniform <i>k</i>-partition problems which consist in partitioning <i>m</i> sets, each of cardinality <i>k</i>, into <i>k</i> sets of cardin...

Rotating work schedules are encountered in several industries and public sector organizations where work is carried out 24 hours a day, seven days a week. ...

We survey computers systems which help to obtain and sometimes provide automatically conjectures and refutations in algebraic graph theory.

A generalization of the Roy-Gallai theorem on the chromatic number of a graph is derived which is also an extension of several other results of Berge and of...

We give characterizations of integral graphs in the family of complete split graphs and a few related families of graphs.

Variable neighborhood search (VNS) is a recent metaheuristic for solving combinatorial and global optimization problems whose basic idea is systematic chang...