This paper describes a planning problem faced by a fast-growing petroleum company in West Africa. The problem is a complex variant of the petrol station repl...

Efficiently solving a vehicle routing problem (\(\mathcal{VRP}\)) in a practical runtime is a critical challenge for delivery management companies. This pa...

The truck loading and inventory routing problems are the two most important decisions made by companies replenishing petrol stations. This paper investigates...

Le problème du partitionnement d'ensemble est un problème de programmation en nombres entiers très étudié. Le problème consiste à trouver une partition de tâ...

Incentive-based demand response aggregators are widely recognized as a powerful strategy to increase the flexibility of residential community microgrid (RCM)...

Benders decomposition has been applied significantly to tackle large-scale optimization problems with complicating variables, which, when temporarily fixed, ...

Operations research specialists at the OCP Group, the Mohammed VI Polytechnic University, and the Polytechnique Montreal operationalized a system optimizing ...

Perturbations are universal in supply chains, and their appearance is getting more frequent in the past few years. These perturbations affect industries and ...

This paper develops an efficient hybrid algorithm to solve the credit scoring problem. We use statistical mathematical programming to develop new classificat...

We consider the problem of minimizing the linear cost of multistate homogeneous series-parallel system given the nonlinear reliability constraint on the syst...

This paper presents a multiobjective, mixed-integer linear programming (MILP) model that integrates production scheduling, inventory management, and vessel a...

The parameter configuration problem consists of finding a parameter configuration that provides the most effective performance by a given algorithm. This pap...

For a simple connected graph \(G\), let \(D(G), ~Tr(G)\), \(D^{L}(G)=Tr(G)-D(G)\), and \(D^{Q}(G)=Tr(G)+D(G)\) be the distance matrix, the diagonal m...

For a graph \(G\), the signless Laplacian matrix \(Q(G)\) defined as \(Q(G) = D(G) + A(G)\), where \(A(G)\) is the adjacency matrix of \(G\) and `...

The primal simplex algorithm is still one of the most used algorithms by the operations research community. It moves from basis to adjacent one until optimal...

Personnel scheduling aims to determine least-cost personnel schedules to meet the demand for employees in each period of a planning horizon. In this article,...

The crew pairing problem (CPP) is solved in the first step of the crew scheduling process. It consists of creating a set of pairings (sequence of flights, co...

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

Overbooking is a common practice in the air cargo industry because booked and actual demands often differ greatly. As a consequence, in case of excessive ove...

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