Logistique intelligente (conception d’horaires, chaînes d’approvisionnement, logistique, systèmes manufacturiers)
RetourCahiers du GERAD
793 résultats — page 31 de 40
The probabilistic satisfiability problem consists, given <i>m</i> logical sentences, with their probabilities to find if they are coherent, and if it is the...
référence BibTeX
We discuss the relationship between probabilistic logic and <img src="pi.gif" align=bottom>-CMS. Given a set of logical sentences and probabilities, the ou...
référence BibTeX
In a graph <i>G</i>, a <i>k-club</i> is a vertex set inducing a subgraph of diameter <i>k</i>. These structures play an important role in several applicati...
référence BibTeX
Le problème de plus court chemin avec contraintes de ressources consiste à trouver un chemin d'un point origine à un point destination de coût minimum et re...
référence BibTeX
Rotating schedules are commonly used in a number of industries and public services where employees work round the clock, seven days a week. Several rules g...
référence BibTeX
An exact algorithm is proposed for minimum sum-of-squares nonhierarchical clustering, i.e., for partitioning a given set of points from Euclidean <i>m</i>-s...
référence BibTeX
The problem of assigning locomotives and cars to trains is a complex task for most railways. In this paper, we propose a multi-commodity network flow based ...
référence BibTeX
Given a graph <i>G</i> with <i>n</i> vertices and stability number <img src="alpha.gif" align=bottom>(<i>G</i>), Turán's theorem gives a lower bound on the ...
référence BibTeX
An important aspect of railway planning concerns the distribution of locomotives and cars in the network and their assignment to the scheduled trains. In th...
référence BibTeXÉtude des différentes pratiques de l'ingénierie concourante: une enquête dans l'industrie québécoise
Dans le cadre du projet de recherche franco-québécois "COPRAIC": COnception et PRoduction Accélérées dans un contexte d'Ingénierie Concourante, une enquête ...
référence BibTeX
This paper considers the placement of components onto printed circuit boards (PCB's) using surface mount technology. Multiple automatic placement machines, ...
référence BibTeX
Cet article décrit un problème d'horaires mensuels personnalisés pour les membres d'équipage (pilotes et officiers) en transport aérien. Ce problème consist...
référence BibTeX
Dans le cadre du projet de recherche franco-québécois "COPRAIC": COnception et PRoduction Accélérées dans un contexte de l'Ingénierie Concourante, une enquê...
référence BibTeX
We consider Nash equilibria as correlated equilibria and apply polyhedral theory to study extreme Nash equilibrium properties. We obtain an alternate proof ...
référence BibTeX
This paper considers the shortest path problem with waiting costs (SPWC) as an extension of the shortest path problem with time windows. The problem consis...
référence BibTeX
In recent years, there have been several important algorithmic developments for the traveling salesman problem and the vehicle routing problem. These incl...
référence BibTeX
One of the many problems faced by rail transportation companies is to optimize the utilization of the available stock of locomotives and cars. In this paper...
référence BibTeX
The aim of this paper is to present a survey of recent optimization models for the most commonly studied rail transportation problems. For each group of pro...
référence BibTeXStabilized Column Generation
Column generation is often used to solve large scale optimization problems, and much research has been devoted to improve the convergence of the solution pr...
référence BibTeX
The paper deals with a problem of determining optimal advertising expenditures in a two-member channel of distribution in which the manufacturer invests in ...
référence BibTeX