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

Besides speed and period length, the quality of uniform random number generators is usually assessed by measuring the uniformity of their point sets, formed...

The problem retained for the ROADEF’99 international challenge was an inventory management problem for a car rental company. It consists in managing a given...

Let &nbsp;<img src="/cgi-bin/mimetex.cgi?G=(V,E)">&nbsp; be a simple graph with vertex degrees &nbsp;<img src="/cgi-bin/mimetex.cgi?d1, d2, \ldots, d_n...

We consider stochastic dynamic games in large population conditions where multiclass agents are weakly coupled via their individual dynamics and costs. We a...

This paper argues that the literature applying differential games in economics and management science has aimed to a large extent for analytical results. On...

In this survey, a classification of twenty-seven Asymmetric Traveling Salesman Problem (ATSP) formulations is presented. The strength of their LP relaxation...

This paper addresses the structural optimization of a next generation optical, lattice based, yottabit-per-second transport network topology, called the <i>...

In [<i>SIAM J. Optim.</i>, 17 (2006), pp. 188–217] Audet and Dennis proposed the class of <i>mesh adaptive direct search algorithms</i> (MADS) for minimizat...

The vehicle routing problem with time windows consists of delivering goods at minimum cost to a set of customers using an unlimited number of capacitated ve...

We use a stylized gas system to study the use of access-to-gas storage in a seasonal model. In a duopoly setting, we find that welfare is higher under vert...

Let &nbsp;<img src="/cgi-bin/mimetex.cgi?G=(V,E)"> be a simple graph with &nbsp;<img src="/cgi-bin/mimetex.cgi?n=|V|"> vertices and &nbsp;<img src="/cgi-bin/...