The distance matrix of a chemical graph can be computed in quadratic time, and from it can be obtained the distance level patterns (DLP), Wiener, Szeged and...

We consider a given set of offshore platforms and onshore wells, producing known (or estimated) amounts of oil, to be connected to a port. Connections may t...

This work develops a class of stochastic optimization algorithms. It aims to provide numerical procedures for solving threshold-type optimal control probl...

This paper deals with the class of uncertain systems with muliple time-delays. The stability and stabibizability of this class of systems are considered. Th...

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

In this paper, we study the aircraft loading problem (ALP) which consists of transporting a series of items between two different points by aircraft at a mi...

Variable Neighborhood Search (VNS) is a recent metaheuristic which exploits systematically the idea of change of neighborhood within the search. After recal...

In this paper, we survey applications and algorithms pertaining to an important class of price setting problems formulated in the framework of bilevel progr...

We review the work of B. Roy in graph theory and its posterity.

This paper studies the class of uncertain linear systems with time-delay and Markov jump disturbance, in which the time-delay is assumed to be dependent on...

Given a set of logical sentences together with nonnegative weights assigned to each of them, the Maximum Weight Satisfiability problem (MAX-WEIGHT SAT) cons...

A Basic Variable Neighbourhood Search heuristic is applied to min-max global optimization problems. The method is tested on the spread spectrum radar polyph...

We modify the algorithm of Pardalos and Rodgers [40] for the minimization of a pseudo-boolean quadratic function by introducing an easy to compute lower bou...

The set of equilibrium points of a bimatrix game is the union of polytopes that are not necessarily disjoint. Knowledge of the vertices of these polytopes ...

Clique partitionning in Euclidean space <b>R</b>ⁿ consists in finding a partition of a given set of <i>N</i> points into <i>M</i> clusters in ord...

The operating schedule problem in open-pit mine can be associated with the problem of maximal closure on a graph. In the literature, the Lagrangian relaxati...

Assigning locomotives and cars to a set of scheduled trains is a complex but important problem for passenger railways. This task is normally carried out in ...

Since Hinkley's original work on exact inference for a change in a sequence of random variables, many authors have proposed different methods based either o...

Ce papier présente une nouvelle procédure de classification, appelée PROCFTN, basée sur le domaine de l'aide multicritère à la décision. Le principe général...

In a research synthesis on the prognosis of depression, the outcome of interest has a multinomial distribution with the following typical categories: well, ...