An algorithm with a complexity linear in the number of vertices is proposed for the computation of the Hyper-Wiener index of chemical trees. This complexity...

La Recherche à Voisinage Variable (RVV) est une métaheuristique récente basée sur l'idée d'un chargement systématique de voisinage, à la fois dans une phase...

Currently, technological possibilities for implementing multi-service networks include both single technology ATM or IP networks and multi-technology netwo...

This paper considers the problem of locating a facility not among demand points, as is usually the case, but among demand regions which could be market area...

We consider the problem of locating a line or a line segment in three-dimensional space, such that the sum of distances from the facility represented by the...

Preapheresis quantification of circulating CD34+ cells (CD34) may be used to predict peripheral blood progenitor cell (PBPC) yield in subsequent leukapheres...

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