Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Michel Gendreau
Information about the author Michel Gendreau will soon be added to the site.
Found
118 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Issues in real-time fleet management
2004
In this editorial comment, new issues in real-time fleet management arising from the...
Design for optimized multi-lateral multi-commodity markets
2005
In this paper, we propose a design for an economically efficient, optimized,...
Models for bundle trading in financial markets
2005
Bundle trading is a new trend in financial markets that allows traders to submit...
Economies of scale in empty freight car distribution in scheduled railways
2004
In this paper, we consider empty freight car distribution in a scheduled railway...
Solving the hierarchical Chinese postman problem as a rural postman problem
2004
In the undirected hierarchical Chinese postman problem (HCPP), the edges of a graph...
Evolutionary algorithms for the vehicle routing problem with time windows
2004
This paper surveys the research on evolutionary algorithms for the Vehicle Routing...
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
2004
In this article, we propose a solution procedure for the Elementary Shortest Path...
Design issues for combinatorial auctions
2004
Combinatorial auctions are an important class of market mechanisms in which...
Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
2004
In this paper, we propose a path relinking procedure for the fixed-charge capacitated...
Generalized insertion ants for the traveling salesman problem
2004
In this paper, the probabilistic nearest neighbor heuristic, which is at the core of...
Solving vehicle routing problems with time windows with constraint programming based column generation
2004
Constraint programming based column generation is a hybrid optimization framework...
A new bidding framework for combinatorial e-auctions
2004
Bidding languages define the means through which participants in an electronic auction...
Cooperative parallel variable neighborhood search for the p-median
2004
We propose a cooperative multi-search method for the Variable Neighborhood Search...
Heuristics and lower bounds for the bin packing problem with conflicts
2004
In the bin packing problem with conflicts, the aim is to pack items into the minimum...
Cooperative parallel tabu search for capacitated network design
2002
We present a cooperative parallel tabu search method for the fixed charge,...
Vehicle dispatching with time-dependent travel times
2003
Most of the models for vehicle routing reported in the literature assume constant...
A tabu search heuristic for resource management in naval warfare
2003
Effective utilization of scarce resources, in particular weapon resources, is a...
A general approach to the physician rostering problems
2002
This paper presents a hybridization of a Constraint Programming (CP) model and search...
Modeling bus stops in transit networks: A survey and new formulations
2001
In this paper, we undertake a detailed study of the bus stop problem in congested...
Constraint programming and operations research: Comments from an operations researcher
2002
This paper relates the author's personal experience with constraint programming and...
Using constraint-based operators to solve the vehicle routing problem with time windows
2002
This paper presents operators searching large neighborhoods in order to solve the...
A heuristic for the location of a rapid transit line
2002
This article presents a mathematical model and a two-phase heuristic for the location...
A tabu search heuristic for the Steiner tree problem
1999
The Steiner Tree Problem (STP) in graphs is a well-known NP-hard problem. It has...
A branch-and-cut algorithm for the undirected selective traveling salesman problem
1998
The Selective Traveling Salesman Problem (STSP) is defined on a graph in which profits...
First Page
1
2
3
4
5
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers