We study the complexity and propose an algorithm for the problem of determining, given <i>p</i> vectors of {-1, 1}<i>ⁿ</i>, all linear combinatio...

Consider <i>N</i> entities to be classified, with given weights, and a matrix of dissimilarities between pairs of them. The split of a cluster is the small...

This paper deals with a decomposition technique for linear programs which proposes a new treatment of the master program in the classical Dantzig-Wolfe algo...

In this paper we study the infinite-horizon optimal control of linear stochastic systems with quadratic cost integrand.

In this paper, we suggest an approximation procedure for the solution of two-player zero-sum stochastic games with continuous state and action spaces simila...

We show in this paper how set partitioning formulation and column generation techniques can be used to model and solve to optimality large scale vehicle rou...

The concept of moduloïd over a dioïd has been introduced in M. Gondran and M. Minoux [8] for the algebraic structure left invariant under the action of a ma...

In this paper we address the problem of simultaneously selecting the composition and routing of a fleet of vehicles in order to efficiently service customer...

The problem of two processors in series and <i>n</i> parts is considered, when processing times depend on some state variable. It is first shown that the mi...

Unconstrained hyperbolic 0-1 programming can be solved in linear time when the numerator and the denominator are linear and the latter is always positive. I...

The problem we consider is that of preparing a minimum cost transportation plan by simultaneously solving the following two sub-problems: first the assignm...

The purpose of this paper is to describe the correspondence between certain natural substructures of Boolean rings, of Boolean lattices, and of hypercubes d...

Ordered sets are used as a computational model for motion planning in which figures on the plane may be moved along a ray emanating from a light source. The...

This paper presents a model for the optimization of productivity in a steel plant comprised of four arc furnaces and three continuous casting machines and su...

We propose a method for producing a feasible schedule for an assembly line of the Generalized Flow Shop type, i.e., jobs must be processed on a set of machi...

Several authors have proposed to estimate Lipschitz constants in global optimization by a multiple of the largest slope (in absolute value) between successi...

An "intelligent front-end" or "logic assistant" is an interactive program devised to assist the users of an information retrieval system in the formulation ...

We show that the satisfiability and maximum satisfiability problems can be transformed into set covering problems at the expense of acceptable increase of s...

Nous établissons un état de l'art exhaustif, conçernant les problèmes de tournées multivéhicules et nomo-dépots, avec contraintes de capacité et de fenêtres...

We propose a new algorithm to solve the on-line vertex enumeration problem for polytopes, doing all computations in <i>n</i>-space, where <i>n</i> is the di...