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

This paper presents the first direct implementation of the positive edge criterion using COIN-OR's CLP, where it has been combined with the Devex pivot rule....

In this paper, we suggest a new approach called the <i>return function</i> to deal with the determination of Bayesian-Nash equilibria in games of incomplet...

The <b>VRPTW-ST</b> introduced by Errico et al. (2013) in the form of a chance-constrained model mainly differs from other vehicle routing problems with st...

This article describes the problem in which the edges of a network represent customers, and a quantity of material is delivered to them so that each one achi...

We propose an efficient heuristic method based on Space Partitioning (SP) and Tabu Search (TS) to solve the buffer sizing problem in unreliable production li...

An unreliable single part type transfer line with fixed inter machine buffer sizes is considered. In general, imperfect machines operating with imperfect raw...

The analysis of networks and in particular the identification of communities, or clusters, is a topic of active research with application arising in many dom...

Since its inception, stochastic Data Envelopment Analysis (DEA) has found many applications. The approach commonly taken in stochastic DEA is via chance cons...