3212 résultats — page 125 de 161

et

Roadway snow and ice control (RSIC) is one of the most complex and fascinating venues for arc routing applications. Arc routing problems occur in several di...

référence BibTeX
et

Le problème de plus court chemin avec contraintes de ressources consiste à trouver un chemin d'un point origine à un point destination de coût minimum et re...

référence BibTeX
, , et

In this paper we study the role of order releases and product mix coordination in a complex manufacturing line with batch processors. We develop a planning ...

référence BibTeX

Rotating schedules are commonly used in a number of industries and public services where employees work round the clock, seven days a week. Several rules g...

référence BibTeX

We present a branch and cut algorithm that yields in finite time, a globally <img src="epsilon.gif" align=bottom>-optimal (with respect to feasibility and o...

référence BibTeX
, , et

An exact algorithm is proposed for minimum sum-of-squares nonhierarchical clustering, i.e., for partitioning a given set of points from Euclidean <i>m</i>-s...

référence BibTeX
, et

We consider a resource constrained shortest path problem in acyclic graphs, where resource windows are associated with the arcs, while lower and upper thres...

référence BibTeX

The problem of assigning locomotives and cars to trains is a complex task for most railways. In this paper, we propose a multi-commodity network flow based ...

référence BibTeX
, et

Given a graph <i>G</i> with <i>n</i> vertices and stability number <img src="alpha.gif" align=bottom>(<i>G</i>), Turán's theorem gives a lower bound on the ...

référence BibTeX
et

We propose a new finite cone covering algorithm for concave minimization over a polytope, in which the cones are defined by extreme points of the polytope. ...

référence BibTeX
, et

We study empirically the topology of the local minima of the 3-SAT problem. In particular, we analyze the size of the plateaus, their altitude, their attrac...

référence BibTeX
, et

Different versions of the serial test for testing the uniformity and independence of vectors of successive values produced by a (pseudo)random number genera...

référence BibTeX
, , et

The problem of assigning locomotives to trains consists of selecting the types and number of engines that minimize the fixed and operational locomotive cost...

référence BibTeX
, , , , et

This article presents an overview of planning problems that arise in the design and dimensioning of survivable telecommunications networks using the Synchro...

référence BibTeX
, et

This paper deals with the robust \({\cal H}^\infty\) control problem for uncertain continuous-time linear time-delay system with Markovian jumping paramet...

référence BibTeX
, , et

Non-parametric estimation of smooth functions belonging to Sobolev classes is closely related to the problem of estimating the (infinite dimensional) mean o...

référence BibTeX

An important aspect of railway planning concerns the distribution of locomotives and cars in the network and their assignment to the scheduled trains. In th...

référence BibTeX
, et

Dans le cadre du projet de recherche franco-québécois "COPRAIC": COnception et PRoduction Accélérées dans un contexte d'Ingénierie Concourante, une enquête ...

référence BibTeX

We present branch and bound algorithms that enumerate in finite time all Nash equilibria for strategic and sequence form bimatrix games. For each forms, th...

référence BibTeX
, et

This paper considers the placement of components onto printed circuit boards (PCB's) using surface mount technology. Multiple automatic placement machines, ...

référence BibTeX