Christophe Duhamel
Christophe Duhamel
maître de conférences en Informatique, ISIMA, Université Blaise Pascal
Verified email at - Homepage
Cited by
Cited by
A GRASP× ELS approach for the capacitated location-routing problem
C Duhamel, P Lacomme, C Prins, C Prodhon
Computers & Operations Research 37 (11), 1912-1923, 2010
A tabu search heuristic for the vehicle routing problem with backhauls and time windows
C Duhamel, JY Potvin, JM Rousseau
Transportation science 31 (1), 49-59, 1997
A genetic algorithm for vehicle routing with backhauling
JY Potvin, C Duhamel, F Guertin
Applied Intelligence 6 (4), 345-355, 1996
A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
C Duhamel, P Lacomme, A Quilliot, H Toussaint
Computers & Operations Research 38 (3), 617-640, 2011
A GRASP heuristic for the capacitated minimum spanning tree problem using a memory-based local search strategy
MC Souza, C Duhamel, CC Ribeiro
Metaheuristics: Computer decision-making, 2002
Efficient frameworks for greedy split and new depth first search split procedures for routing problems
C Duhamel, P Lacomme, C Prodhon
Computers & Operations Research 38 (4), 723-739, 2011
Connecting a population dynamic model with a multi-period location-allocation problem for post-disaster relief operations
C Duhamel, AC Santos, D Brasil, E Châtelet, B Birregah
Annals of Operations Research 247 (2), 693-713, 2016
Optimal solutions for fault-tolerant topology control in wireless ad hoc networks
REN Moraes, CC Ribeiro, C Duhamel
IEEE Transactions on wireless communications 8 (12), 5970-5981, 2009
A hybrid evolutionary local search with depth first search split procedure for the heterogeneous vehicle routing problems
C Duhamel, P Lacomme, C Prodhon
Engineering Applications of Artificial Intelligence 25 (2), 345-358, 2012
A memetic approach for the capacitated location routing problem
C Duhamel, P Lacomme, C Prins, C Prodhon
Proceedings of the 9th EU/Meeting on Metaheuristics for Logistics and …, 2008
An ELS-based approach with dynamic probabilities management in local search for the Dial-A-Ride Problem
M Chassaing, C Duhamel, P Lacomme
Engineering Applications of Artificial Intelligence 48, 119-133, 2016
A GRASP× ELS for the vehicle routing problem with basic three-dimensional loading constraints
P Lacomme, H Toussaint, C Duhamel
Engineering Applications of Artificial Intelligence 26 (8), 1795-1810, 2013
Variable neighborhood descent with iterated local search for routing and wavelength assignment
AX Martins, C Duhamel, P Mahey, RR Saldanha, MC de Souza
Computers & Operations Research 39 (9), 2133-2141, 2012
Models and heuristics for a minimum arborescence problem
C Duhamel, L Gouveia, P Moura, M Souza
Networks: An International Journal 51 (1), 34-47, 2008
Heuristics for designing energy-efficient wireless sensor network topologies
AC Santos, F Bendali, J Mailfert, C Duhamel, KM Hou
Journal of networks, 2009
Models and hybrid methods for the onshore wells maintenance problem
C Duhamel, AC Santos, LM Guedes
Computers & Operations Research 39 (12), 2944-2953, 2012
Multicommodity flow problems with a bounded number of paths: A flow deviation approach
C Duhamel, P Mahey
Networks: An International Journal 49 (1), 80-89, 2007
Using branch-and-price to solve multicommodity k-splittable flow problems
J Truffot, C Duhamel, P Mahey
Proceedings of international network optimization conference (INOC), 2005
A branch and price algorithm for the k-splittable maximum flow problem
J Truffot, C Duhamel
Discrete Optimization 5 (3), 629-646, 2008
Un cadre formel pour les méthodes par amélioration itérative: application à deux problèmes d'optimisation dans les réseaux
C Duhamel
Clermont-Ferrand 2, 2001
The system can't perform the operation now. Try again later.
Articles 1–20