This paper describes three recent tools for dealing with primal degeneracy in linear programming. The first one is the Improved Primal Simplex (IPS) algor...

The airline crew scheduling problem involves assigning a group of crew members to scheduled flights over a planning horizon (usually a month) while respectin...

Effective route planning for battery electric commercial vehicle (ECV) fleets has to take into account their limited autonomy and the possibility of visiting...

Cake-cutting is a metaphor for problems where a principal agent has to fairly allocate resources. Such problems cover various areas of operations research ...

Since its introduction in 1969, the set partitioning problem has received much attention, and the structure of its feasible domain has been studied in detail...

Facility location decisions play a critical role in transportation planning. In fact, it has recently become essential to study how such commitment integrate...

Including employee preferences in a shift-scheduling scheme raises the question of how to aggregate employee satisfactions in a sensible manner. To do so, we...

In this paper, we introduce a new measure of social fairness based on unfairness feelings of the players involved in an allocation problem, e.g., cake-cuttin...

The distance signless Laplacian of a connected graph \(G\) is defined by \(\mathcal{D}^\mathcal{Q} = Diag(Tr) + \mathcal{D}\), where \(\mathcal{D}\) is...

Proximity \(\pi\) and remoteness \(\rho\) are respectively the minimum and the maximum, over the vertices of a connected graph, of the average distance f...

Given a linear program (LP ) with m constraints and n lower and upper bounded variables, any solution \(x^0\) to LP can be represented as a nonne...

In this article, we solve the pickup and delivery problem with time windows and last-in-first-out (LIFO) loading. LIFO loading minimizes handling while unloa...

The buffer sizing problem in unreliable production lines is a complex combinatorial optimization problem. In the formulation of the problem, the system consi...

We consider a dynamic closed-loop supply chain made up of one manufacturer and one retailer, with both players investing in a product recovery program to inc...

Shift scheduling when the demand for employees is stochastic is usually done in two steps. Since employees need to know their shifts before the demand is kno...

This paper focuses on the resolution of the capacitated minimum cost flow problem on a network comprising <i>n</i> nodes and <i>m</i> arcs. We present a met...

We present a matheuristic, an integer programming based heuristic, for the liner shipping network design problem. This problem consists of finding a set of...

The inventory-routing problem (IRP) integrates two well-studied problems, namely, inventory management and vehicle routing. Given a set of customers to servi...

The dust suppression of hauling roads in open-pit mines is done by periodically spraying water from a water truck. The objective of this article is to presen...

Finding communities in complex networks is a topic of much current research and has applications in many domains. On the one hand, criteria for doing so hav...