The uncapacitated multiple allocation p-hub center problem (UMApHCP) consists of choosing p hub locations from a set of nodes with pairwise traffic deman...

Usually several neighborhood structures may be explored within a single local search algorithm. The simplest way is to define a single neighborhood as a unio...

In this paper we show that the Clique Partitioning Problem can be reformulated in an equivalent form as the Maximally Diverse Grouping Problem (MDGP). We th...

In the present paper, we are interested in bounding differences between graph invariants as well as in characterizing the corresponding extremal graphs. This...

This paper proposes models and algorithms for the pickup and delivery vehicle routing problem with time windows and multiple stacks. Each stack is rear-loade...

In this paper, we present a stochastic two-level optimization model whose upper-level problem depicts a wastewater treatment plant deciding on the size of co...

In this paper we present a new rolling horizon approach for solving stochastic mixed complementarity problems (MCPs). Such a scheme allows for decision-depen...

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