We consider logistic collaborations where multiple carriers collaborate by consolidating demands, combining delivery routes, and serving new customers. Logis...

We study a class of deterministic two-player nonzero-sum differential games where one player uses piecewise-continuous controls to affect the continuously e...

Nous considérons le problème d'un gouvernement qui souhaite promouvoir le remplacement des vieilles voitures par des neuves via un programme de mise à la cas...

Dans cet article, nous étudions la question de la cohérence temporelle des accords de coopération dans les jeux dynamiques à utilité non transférable. Un acc...

Nous représentons une chaîne d'approvisionnement en boucle fermée composée d'un fabricant et d'un détaillant comme un jeu dynamique joué sur un arbre d'évén...

Nous étudions un jeu séquentiel à deux étapes dans un duopole de produits substituables en considérant que les firmes peuvent poursuivre un double objectif...

Given a set of predefined duties and groups of drivers, the duty assignment problem with group-based driver preferences (DAPGDP) aims at building rosters tha...

We consider computationally expensive blackbox optimization problems and present a method that employs surrogate models and concurrent computing at the searc...

We study a new variant of the well-studied Vehicle Routing Problem with Time Windows (VRPTW), called the fragility-constrained VRPTW, which assumes that ...

Berth allocation and pilotage planning are the two most important decisions made by a seaport for serving incoming vessels. Traditionally, the berth allocati...

This work investigates lot-sizing with component substitution under demand uncertainty. The integration of component substitution with lot-sizing in an uncer...

Generation expansion planning (GEP) is a classical problem that determines an optimal investment plan for existing and future electricity generation technolo...

This work introduces the StoMADS-PB algorithm for constrained stochastic blackbox optimization, which is an extension of the mesh adaptive direct-search (MAD...

This paper proposes a way to combine the Mesh Adaptive Direct Search (MADS) algorithm with the Cross-Entropy (CE) method for non smooth constrained optimizat...

In this paper, we propose an exact branch-price-and-cut (BPC) algorithm for the two-echelon vehicle routing problem with time windows. This problem arises i...

Le Neuvième atelier de résolution de problèmes industriels de Montréal, qui eut lieu du 19 au 23 août 2019, fut organisé conjointement par le CRM et l'Instit...

We propose a new stochastic variance-reduced damped L-BFGS algorithm, where we leverage estimates of bounds on the largest and smallest eigenvalues of the He...

This paper studies disjunctive cutting planes in Mixed-Integer Conic Programming. Building on conic duality, we formulate a cut-generating conic program for...

Data acquisition and recording in the form of databases are routine operations. The process of collecting data, however, may experience irregularities, res...

This work reviews blackbox optimization applications over the last twenty years, addressed using direct search optimization methods. Emphasis is placed on...