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

L'évaluation des émissions et le transport à grandes distances des polluants atmosphériques (TGDPA) sont des composantes essentielles de la problématique de...

We determine here sufficient conditions for finite dimensional moduloïds and pseudomodules to be lattices. As could be expected, completeness of the scalar ...

We consider the following global optimization problems for a Lipschitz function <i>f</i> implicitly defined on an interval [<i>a,b</i>]. Problem <i>P'</i>:...

We consider the following global optimization problems for a univariate Lipschitz function <i>f</i> defined on an interval [<i>a,b</i>]: Problem <i>P</i>: f...

In this note it is shown that no general hypothesis on the cost functions can guarantee that a Pareto optimal solution to a linear bilevel programming probl...

The vehicle routing problem (VRP) involves the design of a set of minimum cost routes, originating and terminating at a central depot, for a fleet of vehicl...

Consider a flow-shop with <i>n</i> parts, whose processing times are state dependent. Since the state often depends on the sequence, a hierarchical approach...

FORTRAN code of an efficient implementation of a <img src="Theta.gif" align=bottom> (<i>N</i>₂) algorithm for the maximum sum-of-splits clusterin...

We report on the development of a linear process model of energy supplies and uses in the province of Ontario (Canada). The minerals industries producing ...