3169 résultats — page 109 de 159

et

We study the structure and point out weaknesses of recently-proposed random number generators based on special types of linear recurrences with small coeffic...

référence BibTeX
, et

We develop stochastic models of time-dependent arrivals, with focus on the application to call centers. Our models reproduce essential features of call cen...

référence BibTeX
, et

Corrected Miller-Tucker-Zemlin type subtour elimination constraints for the Capacitated Vehicle Routing Problem are presented.

référence BibTeX
, et

We consider the problem of maximizing the revenue raised from tolls set on the arcs of a transportation network, under the constraint that users are assign...

référence BibTeX

We present an exact algorithm and three applications of nonconvex quadratically constrained quadratic programming. First, we consider the pooling problem fro...

référence BibTeX
et

This paper deals with the design of a new proposed optical core transport network called the YottaWeb, which offers information delivery at rates thousand of...

référence BibTeX
, et

In this article, we optimally solve an integrated production and material handling scheduling problem. Traditionally, scheduling problems consider machines a...

référence BibTeX
et

The aim of this paper is to present efficient algorithms for the detection of multiple targets in noisy images of a torus. The algorithms are based on the ...

référence BibTeX

Hypermetric inequalities have many applications, most recently in the approximate solution of max-cut problems by linear and semidefinite programming. Howeve...

référence BibTeX
, , et

We develop and analyze parallelization strategies for the Variable Neighborhood Search (VNS) meta-heuristic applied to the <i>p</i>-median problem. The stra...

référence BibTeX
et

Dans une rubrique de la Revue Française de Recherche Opérationnelle intitulée <i>Problèmes plaisans et délectables</i> en hommage à l'oeuvre du 17ème siècle ...

référence BibTeX
et

Albertson (1997) defines the <i>imbalance</i> of an edge (<i>i,j</i>) in <i>E</i> of a graph <i>G</i> = (<i>V,E</i>) as | <i>d<sub>i</sub> - d<sub>j</sub></...

référence BibTeX
, et

The airline revenue management problem can be decomposed into four distinct but related sub-problems that are usually treated separately: demand forecasting...

référence BibTeX
, et

The Travelling Salesman Problem (TSP) is a well-researched problem whose interest lies well beyond the Icosian game or the Knight's tour puzzle. In this pap...

référence BibTeX
, et

This paper describes a real-time fleet-management system for an underground mine. Dispatching, routing, and scheduling are handled simultaneously, taking...

référence BibTeX
, et

The aim of this paper is to present efficient algorithms for the detection of multiple targets in noisy images. The algorithms are based on the optimal filte...

référence BibTeX
et

Le problème d'évaluation d'une option américaine dans le cadre défini par Black et Scholes peut être discrétisé en un problème de complémentarité linéaire, d...

référence BibTeX
et

In CDMA mobile networks, callers that are transmitting through a power station may cause interference at other power stations. When many users are already c...

référence BibTeX
, et

This paper studies the duality gap in the simple plant location problem, and presents general formulas for the gap when certain complementary slackness cond...

référence BibTeX
, et

This paper presents a solution approach for routing a fleet of automated vehicles on haulage networks having one-lane bidirectional road segments. The solu...

référence BibTeX