A benzenoid system <i>H</i> is a finite connected subgraph of the infinite hexagonal lattice without cut bonds and non-hexagonal interior faces. The branchi...

Let <i>N =</i> (<i>V,E</i>) be an undirected network with <i>n</i> vertices and <i>m</i> edges (i.e., |<i>V</i>| = <i>n</i> and |<i>E</i>| = <i>m</i>) in w...

The stochastic linear programming problem with recourse has a dual block angular structure. It can thus be handled by Benders decomposition or by Kelley's m...

We consider a permutation flow-shop with <i>n</i> jobs and <i>m</i> machines, where the jobs processing times are given by a monotone nondecreasing function...

An exact algorithm is proposed for average-linkage divisive hierarchical clustering, i.e., at each level of the hierarchy a cluster is bipartitioned in such...

This paper presents the development of a new optimal dynamic programming algorithm for the minimization of the total traveling cost for the traveling salesm...

We give a new formulation to the multiple-depot vehicle scheduling problem as a set partitioning problem with side constraints, whose continuous relaxation ...

In this paper, we give necessary optimality conditions for the nonlinear bilevel programming problem. Furthermore, at each feasible point, we show that the ...

The NP-hard problem addressed in this paper is well known in the scheduling literature as <i>R</i>|<i>C</i>_{<font size=-1>max</font>}. We introduce...

The problem of finding a minimal length trajectory (MLT) for a mobile robot has changed in the last five years, as vehicle kinematics have come to be taken ...

Ce document explique comment réaliser une implantation efficace d'une méthode d'énumération implicite avec une stratégie du type le meilleur d'abord. Dans l...

We present a method for designing spine layouts. A spine layout is a layout in which a main aisle is used for the movements between the work cells located o...

One type of testing for short circuits in printed circuit boards components is described and modelled as the covering of the edges of a graph by cuts. To mi...

It is shown that the Clar number of a benzenoid hydrocarbon <i>H</i> (defined as the number of circles in a Clar formula, or equivalently as the maximum num...

A proof is given that any normal benzenoid system with <i>h &gt</i> 1 hexagons has two hexagons the removal of each of which results in a normal benzenoid s...

The bilevel programming problem involves two optimization problems where the data of the first one is implicitly determined by the solution of the second. I...

Nous développons une méthode de comparaison de deux profils à l'aide d'un coefficient de concentration des points d'un nuage de l'un des profils par rapport...

We consider graphs <i>G = </i>(<i>V, E</i>) with order <i>p</i> = |<i>V</i>|, size <i>e</i> = |<i>E</i>| and stability number <i><img src="beta.gif" align=m...

In this paper, optimal strip strategies are developed for a variety of two-dimensional and three-dimensional sequencing problems arising in flexible manufac...

Five recent practically efficient methods for solving the maximum clique problem are briefly described and compared on randomly generated graphs. A Fortran ...