Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Gilles Pesant
Information about the author Gilles Pesant will soon be added to the site.
Found
12 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
A column generation algorithm for tactical timber transportation planning
2015
We present a tactical wood flow model that appears in the context of the Canadian...
The Synchronized Dynamic Vehicle Dispatching Problem
2014
This paper solves a particular class of Real Time Vehicle Dispatching Problems where...
Feasibility of the Pickup and Delivery Problem with Fixed Partial Routes: A Complexity Analysis
2012
In the pickup and delivery problem (PDP) a fleet of vehicles must serve customers'...
Checking the Feasibility of Dial‐a‐Ride Instances Using Constraint Programming
2011
In the dial‐a‐ride problem (DARP), a fleet of vehicles must serve...
Using local search to speed up filtering algorithms for some NP‐hard constraints
2011
This paper proposes to use local search inside filtering algorithms of combinatorial...
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 general approach to the physician rostering problems
2002
This paper presents a hybridization of a Constraint Programming (CP) model and search...
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...
An exact algorithm for the maximum k-club problem in an undirected graph
2002
In this paper, we prove that the maximum k -club problem (M k CP) defined on an...
Heuristics for finding k-clubs in an undirected graph
2000
In a graph G , a k -club is a vertex set inducing a subgraph of diameter k . These...
An exact constraint logic programming algorithm for the travelling salesman problem with time windows
1998
This paper presents a constraint logic programming model for the traveling salesman...
On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem
1999
One of the major strengths of Constraint Programming is the flexibility and...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers