The <i>Dial-a-Ride Problem</i> (DARP) consists of designing vehicle routes and schedules for <i>n</i> users who specify pickup and delivery requests between...

Dans cet article, nous présentons une application de la modélisation mathématique et de l'optimisation comme outils d'aide à la décision pour le gestionnair...

We modify a model of climate and economy to address the effects of the reduction in atmospheric pollutants which occurs as a result of climate change mitiga...

In this paper, the general problem of chemical process optimization defined by a computer simulation is formulated. It is generally a nonlinear, non-convex,...

We present a review of several column generation formulations for the Routing and Wavelength Assignment (RWA) problem with the objective of minimizing the b...

Many proposals have been made recently for goodness-of-fit testing of copula models. After reviewing them briefly, the authors concentrate on omnibus proced...

In this paper, the problem of stability and stabilization of Markov jumping singular systems with discontinuities and saturating inputs is addressed. The de...

The value <img src="/cgi-bin/mimetex.cgi?\frac{1}{2n} \cot\left( \frac{\pi}{2n}\right)"> is shown to be an upper bound on the width of any <i>n</i>-sided p...

A popular approach for modeling dependence in a finite-dimensional random vector <b>X</b> with given univariate marginals is via a normal copula that fits t...

We introduce <i>TestU01</i>, a software library implemented in the ANSI C language, and offering a collection of utilities for the empirical statistical te...

The dynamic routing problem for Overlapped Segment Shared Protection in multi-domain networks has not received a lot of interest so far as it is more difficu...

In one-to-one <i>Pickup and Delivery Problems</i> (PDPs), the aim is to design a set of least cost vehicle routes starting and ending at a common depot in o...

We consider a marketing channel where a retailer sells, along the manufacturer’s brand, her own private label. We assume that each player invests in adverti...

A set of vertices <i>S</i> in a graph <i>G</i> is independent if no neighbor of a vertex of <i>S</i> belongs to <i>S</i>. The independence number &alpha is ...

Given a set of timetabled tasks, the multi-depot vehicle scheduling problem is a wellknown problem that consists of determining least-cost schedules for veh...

From the pentagon onwards, the area of the regular convex polygon with <i>n</i> sides and unit diameter is greater for each odd number <i>n</i> than for the...

We consider four conjectures related to the largest eigenvalue of (the adjacency matrix of) a graph (i.e., to the index of the graph). Three of them have be...

We introduce and study a randomized quasi-Monte Carlo method for estimating the state distribution at each step of a Markov chain. The number of steps in th...

Importance sampling (IS) is the primary technique for constructing reliable estimators in the context of rare-event simulation. The asymptotic robustness of...

The fastest long-period random number generators currently available are based on linear recurrences modulo 2. So far, software that provides multiple disjo...