Une étude du transport de roses coupées, en collaboration avec la plantation Mira- flores évalue l’exportation de Bogotá (Colombie) vers Miami (USA), port d...

La localisation d'un site d'approvisionnement pour minimiser les coûts d'opérations est une problématique industrielle courante. Les variables classiques co...

In order to study the conditions for a world self-enforcing agreement on climate change, we model cooperative and non-cooperative world climate strategies w...

Moody's KMV method is a popular commercial implementation of the structural credit risk model pioneered by Merton (1974). It is an algorithm for estimating...

We propose a hybrid method designed to solve a problem of dispatching and conflict-free routing of Automated Guided Vehicles (AGVs) in a Flexible Manufac...

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

Nous décrivons les méta-heuristiques couramment utilisées en optimisation, avec pour objectif de guider toute personne désirant adapter une méta-heuristique...

Several variants and generalizations of the Or-opt heuristic for the <i>Symmetric Traveling Salesman Problem</i> are developed and compared on random and pla...

<p>This paper presents a recent version of the advanced multi-region World MARKAL model used to explore CO2 abatement options.</p> <p>The report describes ...

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

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

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

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

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

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

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

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

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

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

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