This paper deals with the modeling of economy-environment interactions for several countries which are assumed to behave competitively for the control of th...

In this paper, we present three algorithms for the solution of a large-scale zero-sum two-player stochastic game in discrete time, with a finite state set a...

In a previous paper, a global optimization algorithm, called MLEW, is provided for finding Maximum Likelihood Estimators for the three-parameter Weibull dis...

One important issue being addressed in the design of Distributed Computer Networks is how to increase the availability of time-changing information even in ...

We consider nonlinear programs in 0-1 variables with nonlinear constraints and survey the main approaches to their solution: (i) linearization; (ii) algebra...

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