Many properties of benzenoid hydrocarbons can be explained in terms of their maximum number of mutually resonant hexagons. It is shown that this number can ...

In this paper, the expected distance between two uniformly distributed random points in a rectangle or in a rectangular parallelepiped is computed under thr...

It is shown that any vertex which is simplicial in the complementary graph of a given graph belongs to at least one maximum clique of that graph. This prope...

Consider a benzenoid system with fixed bonds and the subgraph obtained by deleting fixed double bonds together with their end vertices and fixed single bond...

The off-line vertex enumeration problem for polytopes consists in determining all vertices of a given polytope <i>P</i>. The on-line vertex enumeration prob...

We consider the problem of minimizing the weighted sum of earliness and tardiness of jobs scheduled around a common due date, <i>d</i>. The weight of a job ...

Examination scheduling is a problem in virtually every high school, college and university. The basic challenge is to schedule examinations over a limited ...

A recent global optimization algorithm using decomposition (GOP), due to Floudas and Visweswaran, when specialized to the case of polynomial functions is sh...

It is an old observation that for the Generalized Assignment Problem (GAP) a Linear Programming (LP) relaxation introduces only few fractions in the solutio...

Cette thèse a pour thème central l'optimisation de diverses opérations accomplies par une cellule flexible traitant le métal en feuilles. Les deux problèmes...

If the processing time of each job in a flow-shop also depends on waiting time (or on the time spent prior to processing), then the choice of a sequence inf...

A method to compute various upper bounds for the Clar number (defined as the number of circles in a Clar formula) of a benzenoid hydrocarbon is given. Based...

Weber's problem consists in locating a facility in the plane in such a way that the weighted sum of Euclidean distances to <i>n</i> given points be minimum....

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

In many manufacturing systems, parts must be fed to automatic machines in a specific orientation. This is often accomplished by what are known as part orien...

A necessary and sufficient condition is given for the Clar graph and the inner dual of a benzenoid system to be equal. It is shown that <i>k &gt</i> 2 hexag...

This paper presents the first experiments undertaken with a stochastic programming model of gas contract portfolio management. This model is intended to be ...

There has been much recent statistical research in the area of inference under constraints. Here we consider the problem of bounded parameter estimation, in...

We investigate here the problems raised by the demand for quality. In particular, we show that the (inverse) demand, which yields the price the consumers ar...

In a first attempt to explain the good behavior of local improvement heuristics (such as Tabu Search and Simulated Annealing) for the <i>k</i>-coloring prob...