We address the problem of accelerating column generation (CG) for set-covering formulations via dual optimal inequalities (DOI). DOI use knowledge of the du...

The integral column generation algorithm (ICG) was recently introduced to solve set partitioning problems involving a very large number of variables. This pr...

In derivative-free and blackbox optimization, the objective function is often evaluated through the execution of a computer program seen as a blackbox. It ...

Production planners in the non-ferrous metal industry face an inherent combinatorial complexity of the metal production process within a fast changing market...

This paper studies the team orienteering problem, where the arrival time and service time affect the collection of profits. Such interactions result in a non...

We propose a generalized decomposition approach for production planning problems with process configuration decisions. These problems appear in contexts wher...

Dealing with demand uncertainty in multi-item lot sizing problems poses huge challenges due to the inherent complexity. The resulting stochastic formulation...

Nous déterminons le prix optimal et la quantité commandée de deux produits substituts offerts dans deux marchés, dont l'un est saisonnier avec un potentiel d...

Cities are facing severe traffic-related problems causing emission thresholds to be exceeded. All around the world, city center access restriction policies a...

In e-commerce warehouses, online retailers increase their efficiency by using a mixed-shelves (or scattered storage) concept, where unit loads are purposeful...

We introduce the conditional \(p\)-dispersion problem (c-pDP), an incremental variant of the \(p\)-dispersion problem (pDP). In the c-pDP, one is given a...

Nous étudions un problème stochastique de planification de production et réapprovision-nement sur trois échelons via un processus de décision en deux étapes....

Personnel scheduling consists of determining least-cost work schedules to cover the demand of multiple jobs expressed in number of employees per job and peri...

Variable fixing by reduced costs is a popular technique for accelerating the solution process of mixed-integer linear programs. For vehicle routing problems ...

User-centered logistics aiming at customer satisfaction are gaining importance due to growing e-commerce and home deliveries. Customer satisfaction can be ...

This paper studies the Dynamic Facility Location Problem with Modular Capacities (DFLPM). We propose a linear relaxation based heuristic (LRH) and an evoluti...

In large commercial airlines, the monthly schedule (roster) of the crew members is usually determined by solving two problems sequentially, namely, the crew ...

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

In the Inventory Routing Problem customer demand is satisfied from inventory which is replenished with capacitated vehicles. The objective is to minimize tot...

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