Nanotherapy represents a promising approach to target tumors with anticancer drugs while minimizing systemic toxicity. Evaluation of nanoparticle (NP) design...

We consider the problem of pricing and advertising a one-time entertainment event. We assume that the organizers want to sell all available tickets. Thre...

Derivative-free optimization (DFO) is the mathematical study of the optimization algorithms that do not use derivatives. One branch of DFO focuses on model-...

Recent progress in energy storage have contributed to create large-scale storage facilities and to decrease their costs. This may bring economic opportunitie...

Maintenance of power generators is essential for reliable and efficient electricity production. Because generators under maintenance are typically inactive, ...

Metros and other rapid transit systems increase the mobility of urban populations while decreasing congestion and pollution. There are now 187 cities with a ...

In emergency call centers (for police, firemen, ambulances, rescue teams) a single event can sometimes trigger many incoming calls to the center in a short p...

We study the behavior of a generalized splitting method for sampling from a given distribution conditional on the occurrence of a rare event. The method retu...

Clustering is the subject of active research in several fields such as operations research, statistics, pattern recognition, and machine learning. The range ...

In this paper, we present an online reinforcement learning algorithm, called Renewal Monte Carlo (RMC), for infinite horizon Markov decision processes with ...

This paper focuses on the traveling salesman problem with time windows (TSPTW) that arises in postal services and parcel deliveries and has features differin...

We consider the maximum \(k\)-cut problem that involves partitioning the vertex set of a graph into \(k\) subsets such that the sum of the weights of the...

In this paper, we establish the maximum number of basic shortest paths in Cartesian product graphs and bounds on the maximum number of the vertex-disjoint sh...

Stochastic programming and distributionally robust optimization seek deterministic decisions that optimize a risk measure, possibly in view of the most adv...

Random number generators were invented before there were symbols for writing numbers, and long before mechanical and electronic computers. All major civiliza...

We consider a network whose links have random capacities and in which a certain target amount of flow must be carried from some source nodes to some destina...

Clustering is an automated and powerful technique for data analysis. It aims to divide a given set of data points into clusters which are homogeneous and/o...

We study the behavior of a generalized splitting method for sampling from a given distribution conditional on the occurrence of a rare event. The method retu...

We survey basic ideas and results on randomized quasi-Monte Carlo (RQMC) methods, discuss their practical aspects, and give numerical illustrations. RQM...

This paper introduces two classes of location problems with interconnected facilities. These problems differ from classical location problems in the sense ...