A method to generate lower bounds for the channel assignment problem is given. The method is based on the reduction of the channel assignment problem to a p...

Eugène est un modèle dynamique de programmation linéaire mixte qui constitue un outil d'aide à la décision efficace pour les décideurs impliqués dans la pla...

Mirkin's additive clustering (or qualitative factor analysis) algorithm explains similarities between entities by sequentially finding a cluster of entities...

It is shown that a geometrically planar fusene is uniquely determined by its boundary edge code. Surprisingly, the same conclusion is not true in general b...

The paper deals with the problem of sustaining over time a coordinated outcome in a two-member channel of distribution. In a dynamic game of pricing and ad...

Variable Neighborhood Search is a recent metaheuristic based on the idea of systematic change of neighborhood during both a descent phase and an exploration...

Changes in financial market are collective human decisions which are result of the dynamics of the neurons. In this paper, we describe a discrete time Recur...

In classical module theory, a module over a principal ideal domain may be split into the direct sum of a free module and a torsion module. This decompositio...

We study several formulations of the channel assignment problem in an FDMA network as a linear integer 0-1 program. We consider the objective of minimizing...

L'affectation de type d'avion aux vols consiste à déterminer, pour chaque arc de vol, le type d'avion qui lui sera affecté de façon à maximiser les profits ...

The Joint Replenishment Problem (JRP) is a multi-item inventory problem. The objective is to develop inventory policies that minimizes the total costs (comp...

In this paper, we prove that the maximum <i>k</i>-club problem defined on an undirected graph is NP-hard. We also give an integer programming formulation f...

This is a review article on lattice methods for multiple integration over the unit hypercube, with a variance-reduction viewpoint. It also contains some new...

This paper deals with the class of continuous-time linear systems with Markovian jumps. We assume that jump rates are controlled. Our purpose is to study th...

The definition of a fullerene as a cubic polyhedron made up entirely of pentagons and hexagons is compatible with a huge variety of isomeric forms for struc...

We present a method for the integral representation of local and global diffeomorphisms between subsets of <img src="G9942-1.gif" align=bottom> and <img src...

Given a set of logical sentences and probabilities that these sentences are true, the probabilistic logic problem consists in determining whether these prob...

This article is a survey of heuristics for the <i>Vehicle Routing Problem</i>. It is divided into two parts: classical and modern heuristics. The first pa...

A new local search heuristic, called J-MEANS, is proposed for solving the minimum sum-of-squares clustering problem. The neighborhood of the current solut...

This paper presents an exact approach for solving the simultaneous vehicle and crew scheduling problem in urban mass transit systems. We consider the single...