Christophe Duhamel

According to our database1, Christophe Duhamel authored at least 40 papers between 1996 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Bi-objective methods for road network problems with disruptions and connecting requirements.
J. Oper. Res. Soc., 2020

Model and methods to address urban road network problems with disruptions.
Int. Trans. Oper. Res., 2020

Modeling and solving the multi-period disruptions scheduling problem on urban networks.
Ann. Oper. Res., 2020

2019
Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data.
CoRR, 2019

2018
Trees and Forests.
Proceedings of the Handbook of Heuristics., 2018

Special issue on "Developments in Optimization for Smart Cities".
Int. Trans. Oper. Res., 2018

Methods for solving road network problems with disruptions.
Electron. Notes Discret. Math., 2018

A MILP-based VND for the <i>min-max</i> regret Shortest Path Tree Problem with interval costs.
Electron. Notes Discret. Math., 2018

2017
A column generation approach for the strong network orientation problem.
Electron. Notes Discret. Math., 2017

2016
Heuristics for designing multi-sink clustered WSN topologies.
Eng. Appl. Artif. Intell., 2016

An ELS-based approach with dynamic probabilities management in local search for the Dial-A-Ride Problem.
Eng. Appl. Artif. Intell., 2016

Connecting a population dynamic model with a multi-period location-allocation problem for post-disaster relief operations.
Ann. Oper. Res., 2016

Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem.
4OR, 2016

2014
Strategies to Optimize the Impact of Supplies Distribution in Post-disaster Operations.
Proceedings of the ICORES 2014, 2014

2013
A Multi-thread GRASPxELS for the Heterogeneous Capacitated Vehicle Routing Problem.
Proceedings of the Hybrid Metaheuristics, 2013

A GRASP×ELS for the vehicle routing problem with basic three-dimensional loading constraints.
Eng. Appl. Artif. Intell., 2013

Optimisation algorithms for microarray biclustering.
Proceedings of the 35th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2013

Efficiency of Parallelisation of Genetic Algorithms in the Data Analysis Context.
Proceedings of the IEEE 37th Annual Computer Software and Applications Conference, 2013

2012
Models and heuristics for the <i>k</i> -degree constrained minimum spanning tree problem with node-degree costs.
Networks, 2012

Strategies for designing energy-efficient clusters-based WSN topologies.
J. Heuristics, 2012

A hybrid evolutionary local search with depth first search split procedure for the heterogeneous vehicle routing problems.
Eng. Appl. Artif. Intell., 2012

Variable neighborhood descent with iterated local search for routing and wavelength assignment.
Comput. Oper. Res., 2012

Models and hybrid methods for the onshore wells maintenance problem.
Comput. Oper. Res., 2012

High-Performance Computing for Data Analytics.
Proceedings of the 16th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications, 2012

2011
A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem.
Comput. Oper. Res., 2011

Efficient frameworks for greedy split and new depth first search split procedures for routing problems.
Comput. Oper. Res., 2011

A VND-ILS Heuristic to Solve the RWA Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

The integrated lot-sizing and vehicle routing problem.
Proceedings of the 2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems, 2011

2010
<i>k</i>-Splittable delay constrained routing problem: A branch-and-price approach.
Networks, 2010

A GRASP×ELS approach for the capacitated location-routing problem.
Comput. Oper. Res., 2010

2009
Optimal solutions for fault-tolerant topology control in wireless ad hoc networks.
IEEE Trans. Wirel. Commun., 2009

Heuristics for Designing Energy-efficient Wireless Sensor Network Topologies.
J. Networks, 2009

Aggregation approach for the minimum binary cost tension problem.
Eur. J. Oper. Res., 2009

2008
Models and heuristics for a minimum arborescence problem.
Networks, 2008

A Branch and Price algorithm for the k-splittable maximum flow problem.
Discret. Optim., 2008

An Optimization Approach for Designing Wireless Sensor Networks.
Proceedings of the NTMS 2008, 2008

Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem.
Proceedings of the Modelling, 2008

2007
Multicommodity flow problems with a bounded number of paths: A flow deviation approach.
Networks, 2007

1997
A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows.
Transp. Sci., 1997

1996
A Genetic Algorithm for Vehicle Routing with Backhauling.
Appl. Intell., 1996


  Loading...