Smart logistics (schedule design, supply chains, logistics, manufacturing systems)
BackCahiers du GERAD
781 results — page 9 of 40
In this article, we discuss an alternative method for deriving conservative approximation models for two-stage robust optimization problems. The method main...
BibTeX referenceDesigning sustainable mid-haul logistics networks with intra-route multi-resource facilities
Location-routing problems (LRPs) with intra-route facilities have recently gained the attention of researchers and practitioners. Intra-route facilities are ...
BibTeX referenceComputational comparison of several algorithms for the minimum cost perfect matching problem
The aim of this paper is to computationally compare several algorithms for the Minimum Cost Perfect Matching Problem on an undirected graph. Our work is moti...
BibTeX reference
Necessary and sufficient conditions are provided for the existence of a simple
graph, or a simple connected graph with given
numbers \(m_{ij}\)
of edges ...
This paper addresses the solution of the capacitated minimum cost flow problem on a network containing \(n\)
nodes and \(m\)
arcs. Satisfying necessary ...
While the joint optimization of production and outbound distribution decisions in a manufacturing context has been intensively studied in the past decade, th...
BibTeX reference
The distance, distance Laplacian and distance signless Laplacian spectra of a connected graph \(G\)
are the spectra of the distance, distance Laplacian and...
On the nullity number of graphs
The paper discusses bounds on the nullity number of graphs. It is proved in [B. Cheng and B. Liu, On the nullity of graphs. Electron. J. Linear Algebra 16 ...
BibTeX reference
Branch-price-and-cut is a leading methodology for solving various vehicle routing problems (VRPs). For many VRPs, the pricing problem of a branch-price-and-c...
BibTeX reference
In the present paper we are interested in the study of the distance Laplacian eigenvalues of a connected graph with fixed order \(n\)
and chromatic number ...
Two-level orthogonal designs play an important role in industrial screening experiments, in which the primary goal is to identify the treatment factors with ...
BibTeX reference
In this paper, we propose an integer programming model for obtaining lower bounds for the curriculum-based course timetabling problem, in which weekly assign...
BibTeX reference
This paper describes a vector space decomposition algorithmic framework for linear programming guided by dual feasibility considerations. The resolution pro...
BibTeX reference
Synchronization of workers and vehicles plays a major role in many industries such as logistics, healthcare or airport ground handling. In this paper, we fo...
BibTeX reference
This paper studies the impact of service level constraints in the context of the capacitated and uncapacitated lot sizing problems with deterministic demand ...
BibTeX reference
Airline crew scheduling is typically performed in two steps : crew pairing followed by crew assignment. The crew pairing problem (CPP) finds a set of pairing...
BibTeX referenceA Branch-Price-and-Cut algorithm for a production-routing problem with short-lifespan products
We study a rich production-routing problem with time windows arising at a catering services company. The production part consists of assembling the meals to ...
BibTeX reference
The geometric-arithmetic index \(GA\)
of a graph \(G\)
is the sum of ratios, over all edges of \(G\)
, of the geometric mean to the arithmetic mean of t...
In the present paper, we compare the geometric-arithmetic index \(GA\)
and the chromatic number \(\chi\)
of a connected graph with given order. We prove,...
The technological developments observed in the last two decades contributed to the digitalization of products and the introduction of devices to consume th...
BibTeX reference