3083 résultats — page 136 de 155

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

référence BibTeX
et

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

référence BibTeX
, et

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

référence BibTeX

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

référence BibTeX
et

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

référence BibTeX
et

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

référence BibTeX
, et

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

référence BibTeX
et

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

référence BibTeX
et

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

référence BibTeX

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

référence BibTeX
et

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

référence BibTeX
et

The rectangular cutting-stock problem consists in laying out a specified list of rectangular pieces on a minimum number of rectangular sheets. A pattern is ...

référence BibTeX
, et

In this paper a class of large, structured linear programs arising in multi-regional (or multi-sectoral) commodity exchange problems, is examined. A decompo...

référence BibTeX
et

We show that certain reasonable axioms for an optimal solution to the problem of locating a facility on a network, i.e., axioms of distance determination, P...

référence BibTeX
, , , et

We present a new two-commodity flow formulation for the traveling salesman problem. Each commodity corresponds to a resource that is either distributed or p...

référence BibTeX
et

This note deals with spatial (multi-market) and multi-commodity versions of the classical Cournot (1838) oligopoly. Our objective is to find non-cooperative...

référence BibTeX
, et

In the vehicle routing cost allocation problem the aim is to find a good cost allocation method, i.e. a method that according to specified criteria allocate...

référence BibTeX

We consider a differential game model to investigate the effects of price subsidy over time on the rate of diffusion of a new technology. We assume that the...

référence BibTeX
, , et

The large-scale MARKAL Linear Program is applied (separately) to the energy systems of Québec and of Ontario, under several alternative constraints on emiss...

référence BibTeX
et

This paper proposes a model for the optimal choice among three alternative new markets for Québec electricity: new electrical processes in the industrial se...

référence BibTeX