Issmail El Hallaoui

Retour

Cahiers du GERAD

42 résultats — page 1 de 3

, et

Pour un graphe simple et connexe \(G\), soient \(D(G), ~Tr(G)\), \(D^{L}(G)=Tr(G)-D(G)\), et \(D^{Q}(G)=Tr(G)+D(G)\) la matrice des distances, la mat...

référence BibTeX
et

Pour un graphe \(G\), la matrice du laplacien sans signe \(Q(G)\) esf définie comme \(Q(G) = D(G) + A(G)\), o`u \(A(G)\) est la matrice d'adjacence ...

référence BibTeX
, et

The primal simplex algorithm is still one of the most used algorithms by the operations research community. It moves from basis to adjacent one until optimal...

référence BibTeX
, et

Personnel scheduling aims to determine least-cost personnel schedules to meet the demand for employees in each period of a planning horizon. In this article,...

référence BibTeX

The crew pairing problem (CPP) is solved in the first step of the crew scheduling process. It consists of creating a set of pairings (sequence of flights, co...

référence BibTeX
, , et

Given a set of predefined duties and groups of drivers, the duty assignment problem with group-based driver preferences (DAPGDP) aims at building rosters tha...

référence BibTeX
, , et

Overbooking is a common practice in the air cargo industry because booked and actual demands often differ greatly. As a consequence, in case of excessive ove...

référence BibTeX
, et

The integral column generation algorithm (ICG) was recently introduced to solve set partitioning problems involving a very large number of variables. This pr...

référence BibTeX

In this paper, we solve a rich real-word Multi-Depot Multi-Period Petrol Replenishment Problem with a heuristic based on Branch-and-Price heuristic. The netw...

référence BibTeX
, et

In the present paper, we prove lower and upper bounds for each of the ratios \(GA/\delta\), as well as a lower bound on \(GA/\sqrt{\delta}\), in terms of...

référence BibTeX
, et

Personnel scheduling consists of determining least-cost work schedules to cover the demand of multiple jobs expressed in number of employees per job and peri...

référence BibTeX

Given a set of duties to be operated over a cyclic one-week horizon and groups of drivers with similar characteristics, the cyclic bus driver rostering probl...

référence BibTeX
, , et

Operations Research (OR) has a very important role to play in credit scoring for building models that can help the lending organization to make a good decisi...

référence BibTeX
, et

Microgrid, a promising component of smart grid, will potentially yield a free electricity market. This paper proposes a novel construction for a community mi...

référence BibTeX
, et

This paper develops an exact method for the redundancy allocation problem (RAP) for multistate homogeneous series-parallel systems. The problem aims to min...

référence BibTeX
, et

The Integral Simplex Using Decomposition (ISUD) algorithm has been developed recently to solve large set partitioning problems (SPPs) in a primal way, i.e.,...

référence BibTeX
, et

The primal adjacency-based algorithm and the multi-directional dynamic programming algorithm are two exact methods that have recently been developed to effic...

référence BibTeX
, et

Les problèmes de gestion de personnel visent à déterminer les horaires de travail les moins coûteux pour couvrir la demande d'une ou plusieurs tâches à chaqu...

référence BibTeX
, et

Clustering is the subject of active research in several fields such as operations research, statistics, pattern recognition, and machine learning. The range ...

référence BibTeX
, , et

This paper addresses the winner determination problem (WDP) for TL transportation procurement auctions under uncertain shipment volumes and uncertain carrier...

référence BibTeX