3212 résultats — page 102 de 161

et

This paper proposes an efficient heuristic to solve the topological design of a next generation optical network that provides fully meshed connectivity betw...

référence BibTeX
et

In this paper we consider mixed oligopoly markets for differentiated goods where private and public firms compete either in prices or quantities. We then st...

référence BibTeX
, et

The Capacitated Arc Routing Problem with Refill Points (CARP-RP) is a new variant of the Capacitated Arc Routing Problem (CARP). In a CARP situation, the v...

référence BibTeX
, , et

We present a MILP mathematical programming formulation for static scheduling of dependent tasks onto homogeneous multiprocessor system of an arbitrary archi...

référence BibTeX
et

G. Marsaglia introduced recently a class of very fast <i>xorshift</i> random number generators, whose implementation uses three "xorshift" operations. They ...

référence BibTeX
et

We study an iterative cutting-plane algorithm on an integer program, for minimizing the staffing costs of a multiskill call center subject to service-level ...

référence BibTeX

The objectives of this paper are twofold; we first demonstrate the flexibility of the mesh adaptive direct search (MADS) in identifying locally optimal algo...

référence BibTeX
, et

Different integer linear programming (ILP) formulations have been proposed for the routing and wavelength assignment problem in WDM optical networks, mainl...

référence BibTeX
, et

We present a review of column generation formulations for the Routing and Wavelength Assignment (rwa) problem with the objective of minimizing the blocking r...

référence BibTeX
, et

The continuous location-allocation problem requires finding sites for <i>m</i> new facilities in the plane in order to serve <i>n</i> users such that the to...

référence BibTeX
, et

Variable Neighborhood Search (VNS) is a recent and effective metaheuristic for solving combinatorial and global optimization problems. It is capable of esca...

référence BibTeX
et

Les problèmes de chargement statique de groupes turbo-alternateurs à vapeur peuvent être exprimés sous forme de minimisation d’une somme de fonction de coût ...

référence BibTeX
et

Dynamic programming is applied to the economic dispatch problem with spin- ning reserve constraint. A first algorithm, based on a direct application of Bell...

référence BibTeX

This paper introduces the first exact approach for constructing aircrew member personalized monthly work schedules when a preferential bidding system (PBS) ...

référence BibTeX

There are many advantages to taking account of multi-lag autocorrelation of the inflows in a reservoir management problem: the flood and water shortage risk...

référence BibTeX
, , et

The global <i>k</i>-means heuristic is a recently proposed (Likas et al. 2003) incremental approach for minimum sum-of-squares clustering of a set <i>X</i> ...

référence BibTeX
, , et

In this paper, we examine the sensitivity of trust-region algorithms on the param- eters related to the step acceptance and update of the trust region. We s...

référence BibTeX
, et

Recent developments in numerical methods for solving large differentiable nonlinear optimization problems are reviewed. State-of-the-art algorithms for solv...

référence BibTeX
, , , et

We consider the problem of separating two sets of points in an <i>n</i>-dimensional real space with a (hyper)plane that minimizes the sum of <i>L<sub>p</sub...

référence BibTeX
, , et

In Duan, Gauthier and Simonato (1999), analytical formulas to approximate the price European options in the GARCH framework were developed. These formulas a...

référence BibTeX