Column generation algorithms for solving vehicle routing problems often rely on a relaxed pricing subproblem where routes may be non-elementary and which is ...

Deploying applications having many processes in a multi-cloud environment is challenging. The cloud manager has goals such as minimizing power consumption, w...

Graphon-based control has recently been proposed and developed to solve control problems for dynamical systems on networks which are very large or growing w...

In this paper we study the linear quadratic regulation (LQR) problem for dynamical systems coupled over large-scale networks and obtain locally computable l...

We present a progressive approximation algorithm for the exact solution of several classes of interdiction games in which two non-cooperative players (namely...

The performance of deep neural networks is highly sensitive to the choice of the hyperparameters that define the structure of the network and the learning pr...

We present a case study of using machine learning classification algorithms to initialize a large scale commercial operations research solver (GENCOL) in the...

This paper considers a dynamic Emergency Medical Services (EMS) network design problem and introduces two novel two-stage stochastic programming formulatio...

Multi-agent reinforcement learning has made significant progress in recent years, but it remains a hard problem. Hence, one often resorts to developing lea...

Given a set of duties to be operated over a cyclic one-week horizon and groups of drivers with similar characteristics, the cyclic bus driver rostering probl...

Microgrid, a promising component of smart grid, will potentially yield a free electricity market. This paper proposes a novel construction for a community mi...

The airline crew scheduling problem involves determining schedules for airline crew members such that all the scheduled flights over a planning horizon (usua...

We consider a class of dynamic collective choice models with social interactions, whereby a large number of non-uniform agents have to individually settle ...

Given a directed graph \(G=(V,A)\), capacity and cost functions on \(A\), a root \(r\), a subset \(T \subset V\) of terminals, and an integer \(k\)...

L'étude des réseaux de télécommunications sans-fil pour cellulaire est importante, car ceux-ci consomment beaucoup d'énergie et ont un impact non négligeable...

Vehicle routing problems (VRPs) are among the most studied problems in operations research. Nowadays, the leading exact algorithms for solving many classes o...

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 this paper, we present an online reinforcement learning algorithm, called Renewal Monte Carlo (RMC), for infinite horizon Markov decision processes with ...

The classical p-median problem assumes that service to customers is always provided by the closest facility, while in practice, customers often interact for...

The multiple depot vehicle scheduling problem (MDVSP) has been widely studied in the context of public transit systems. It consists of building vehicle sched...