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

Nous donnons des conditions nécessaires et suffisante pour l'existence d'un graphe simple, ou d'un graphe connexe simple, ayant des nombres donnés `(m_{ij}...

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

The distance, distance Laplacian and distance signless Laplacian spectra of a connected graph $G$ are the spectra of the distance, distance Laplacian and...

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

La méthode de branch-cut-and-price est la plus performante pour une grande panoplie de problèmes de tournées de véhicules (PTV). Pour plusieurs d'entre eux...

Dans cet article, nous nous intéressons à létude des valeurs propres du laplacien des distances d'un graphe connexe d'ordre $n$ et de nombre chromatique ...

Two-level orthogonal designs play an important role in industrial screening experiments, in which the primary goal is to identify the treatment factors with ...

In this paper, we propose an integer programming model for obtaining lower bounds for the curriculum-based course timetabling problem, in which weekly assign...

This paper describes a vector space decomposition algorithmic framework for linear programming guided by dual feasibility considerations. The resolution pro...

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

Nous étudions ici l'impact des contraintes de niveaux de service dans le contexte des problèmes de planification de production avec ou sans contrainte de cap...

La création d’horaires de personnel aériens est généralement effectuée en deux étapes : la création de rotations d’équipage, suivie par la création d’horaire...

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

L'indice géométrique-arithmétique $GA$ d'un graphe $G$ est la somme des ratios, sur l'ensemble des arêtes de $G$, de la moyenne géométrique sur l...

Dans le présent article, nous comparons l'indice géométrique-arithmétique $GA$ et le nombre chromatique $\chi$ d'un graphe connexe d'ordre donné. Ent...

The technological developments observed in the last two decades contributed to the digitalization of products and the introduction of devices to consume th...

In this paper, we introduce a general framework for vector space decompositions that decompose the set partitioning problem into a reduced problem, defined...

The vehicle routing problem with time windows (VRPTW) consists of finding least-cost vehicle routes to satisfy the demands of customers that can be visited...