We describe two new classes of graphs for which the stability number can be computed in polynomial time. The first approach is based on an iterative procedu...

We consider the directed graph representing the obstruction relation between objects moving along the streamlines of a two-dimensional velocity field. A col...

On présente, à l'aide d'un modèle probabiliste, une approximation d'un indice de concentration d'un nuage de points dans <b>R</b>. Ce modèle conduit à établ...

Konno and Inori (1989) have recently proposed two flexible models for bond portfolio optimization, together with heuristics to solve them. It is shown that ...

A hexagonal system is a connected plane graph without cut vertices in which each interior face is a regular hexagon. A linear algorithm is proposed to find ...

We present a new class of change in risk, which includes several previous ones (price squeeze, strong increase in risk of Meyer and Ormiston) and leads to u...

We investigate the complexity status of the preemptive openshop scheduling problem. After reviewing recent studies of the shop with various objective functi...

The purpose of this paper is to describe a new tabu search heuristic for the vehicle routing problem with capacity and route length restrictions. The algori...

Infinitesimal Perturbation Analysis (IPA) is perhaps the most efficient derivative estimation method for many practical discrete-event stochastic systems, w...

The Markov renewal viewpoint of single part manufacturing systems under hedging point control policies, subjected to a constant demand for parts rate, is us...

La programmation linéaire généralisée peut être étendue au cas des programmes mixtes en utilisant seulement l'algorithme primal révisé du simplexe en variab...

Indefinite quadratic programs with quadratic constraints can be reduced to bilinear programs with bilinear constraints by duplication of variables. Such red...

We consider the complexity status of scheduling <i>n</i> jobs in an openshop with <i>m</i> machines, when overlapping of jobs is permitted, for some classic...

A new branch-and-bound algorithm for linear bilevel programming is proposed. Necessary optimality conditions expressed in terms of tightness of the follow...

This paper deals with the implementation of the interior point cutting plane algorithm of Goffin-Haurie-Vial, with a special application to the solution of ...

The interaction between a utility company and electricity cogenerators is modeled via a game theoretic, systems analysis approach, under the assumption of a...

A bounded vertex coloring of a graph <i>G</i> is a usual vertex coloring in which each color is used at most <i>k</i> times (where <i>k</i> is a given numbe...

We present algorithms for computing some distance functions between two (possibly intersecting) polygons, both in the convex and nonconvex cases. The inter...

We present in this paper a linear time algorithm for the computation of some distance functions between convex polygons in R² in the general case...

This paper presents a new heuristic for the Euclidean planar traveling salesman problem. The heuristic takes advantage of the natural alignment of the point...