default search action
Christophe Duhamel
Person information
- affiliation: Blaise Pascal University, Clermont-Ferrand, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j34]Christophe Duhamel
, Andréa Cynthia Santos
The strong network orientation problem. Int. Trans. Oper. Res. 31(1): 192-220 (2024) - [c10]Thiago Jobson Barbalho, Andréa Cynthia Santos, Juan Luis Jiménez Laredo, Christophe Duhamel:
Modelling and Solving a Scheduling Problem with Hazardous Products Dynamic Evolution. MIC (2) 2024: 249-263 - 2023
- [j33]Iago A. Carvalho
A fix-and-optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty. Int. Trans. Oper. Res. 30(2): 1120-1143 (2023) - [j32]Matheus Nohra Haddad
Intelligent Drone Swarms to Search for Victims in Post-Disaster Areas. Sensors 23(23): 9540 (2023) - 2022
- [j31]Iago A. Carvalho
Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty. RAIRO Oper. Res. 56(6): 4281-4301 (2022) - 2020
- [j30]Amadeu Almeida Coco
Modeling and solving the multi-period disruptions scheduling problem on urban networks. Ann. Oper. Res. 285(1): 427-443 (2020) - [j29]Benjamin Vincent, Christophe Duhamel, Libo Ren, Nikolay Tchernev:
A population-based metaheuristic for the capacitated lot-sizing problem with unrelated parallel machines. Int. J. Prod. Res. 58(21): 6689-6706 (2020) - [j28]Yipeng Huang, Andréa Cynthia Santos
Model and methods to address urban road network problems with disruptions. Int. Trans. Oper. Res. 27(6): 2715-2739 (2020) - [j27]Yipeng Huang, Andréa Cynthia Santos, Christophe Duhamel
Bi-objective methods for road network problems with disruptions and connecting requirements. J. Oper. Res. Soc. 71(12): 1959-1971 (2020)
2010 – 2019
- 2019
- [i1]Iago A. Carvalho, Thiago F. Noronha, Christophe Duhamel:
Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data. CoRR abs/1908.05082 (2019) - 2018
- [j26]Yipeng Huang, Andréa Cynthia Santos
Methods for solving road network problems with disruptions. Electron. Notes Discret. Math. 64: 175-184 (2018) - [j25]Iago A. Carvalho
A MILP-based VND for the min-max regret Shortest Path Tree Problem with interval costs. Electron. Notes Discret. Math. 66: 39-46 (2018) - [j24]Andréa Cynthia Santos
Special issue on "Developments in Optimization for Smart Cities". Int. Trans. Oper. Res. 25(4): 1409-1410 (2018) - [r1]Andréa Cynthia Santos
Trees and Forests. Handbook of Heuristics 2018: 1307-1333 - 2017
- [j23]Alexandre Xavier Martins, Christophe Duhamel
A column generation approach for the strong network orientation problem. Electron. Notes Discret. Math. 62: 75-80 (2017) - 2016
- [j22]Christophe Duhamel
Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem. 4OR 14(2): 201-220 (2016) - [j21]Christophe Duhamel
Connecting a population dynamic model with a multi-period location-allocation problem for post-disaster relief operations. Ann. Oper. Res. 247(2): 693-713 (2016) - [j20]Maxime Chassaing, Christophe Duhamel
An ELS-based approach with dynamic probabilities management in local search for the Dial-A-Ride Problem. Eng. Appl. Artif. Intell. 48: 119-133 (2016) - [j19]Andréa Cynthia Santos
Heuristics for designing multi-sink clustered WSN topologies. Eng. Appl. Artif. Intell. 50: 20-31 (2016) - 2014
- [c9]Christophe Duhamel, Daniel Brasil, Andréa Cynthia Santos, Eric Châtelet, Babiga Birregah:
Strategies to Optimize the Impact of Supplies Distribution in Post-disaster Operations. ICORES 2014: 342-349 - 2013
- [j18]Philippe Lacomme
A GRASP×ELS for the vehicle routing problem with basic three-dimensional loading constraints. Eng. Appl. Artif. Intell. 26(8): 1795-1810 (2013) - [c8]Dimitri Perrin
Efficiency of Parallelisation of Genetic Algorithms in the Data Analysis Context. COMPSAC Workshops 2013: 339-344 - [c7]Dimitri Perrin
Optimisation algorithms for microarray biclustering. EMBC 2013: 592-595 - [p1]Christophe Duhamel
A Multi-thread GRASPxELS for the Heterogeneous Capacitated Vehicle Routing Problem. Hybrid Metaheuristics 2013: 237-269 - 2012
- [j17]Alexandre Xavier Martins, Christophe Duhamel
Variable neighborhood descent with iterated local search for routing and wavelength assignment. Comput. Oper. Res. 39(9): 2133-2141 (2012) - [j16]Christophe Duhamel
Models and hybrid methods for the onshore wells maintenance problem. Comput. Oper. Res. 39(12): 2944-2953 (2012) - [j15]Christophe Duhamel
A hybrid evolutionary local search with depth first search split procedure for the heterogeneous vehicle routing problems. Eng. Appl. Artif. Intell. 25(2): 345-358 (2012) - [j14]Andréa Cynthia Santos
Strategies for designing energy-efficient clusters-based WSN topologies. J. Heuristics 18(4): 657-675 (2012) - [j13]Christophe Duhamel
Models and heuristics for the k -degree constrained minimum spanning tree problem with node-degree costs. Networks 60(1): 1-18 (2012) - [c6]Dimitri Perrin
High-Performance Computing for Data Analytics. DS-RT 2012: 234-242 - 2011
- [j12]Christophe Duhamel
A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem. Comput. Oper. Res. 38(3): 617-640 (2011) - [j11]Christophe Duhamel
Efficient frameworks for greedy split and new depth first search split procedures for routing problems. Comput. Oper. Res. 38(4): 723-739 (2011) - [c5]Heitor Liberalino, Christophe Duhamel
The integrated lot-sizing and vehicle routing problem. CIPLS 2011: 47-52 - [c4]Alexandre Xavier Martins, Christophe Duhamel
A VND-ILS Heuristic to Solve the RWA Problem. INOC 2011: 577-582 - 2010
- [j10]Christophe Duhamel
A GRASP×ELS approach for the capacitated location-routing problem. Comput. Oper. Res. 37(11): 1912-1923 (2010) - [j9]Jérôme Truffot, Christophe Duhamel
k-Splittable delay constrained routing problem: A branch-and-price approach. Networks 55(1): 33-45 (2010)
2000 – 2009
- 2009
- [j8]Bruno Bachelet
Aggregation approach for the minimum binary cost tension problem. Eur. J. Oper. Res. 197(2): 837-841 (2009) - [j7]Andréa C. Santos, Fatiha Bendali, Jean Mailfert, Christophe Duhamel
Heuristics for Designing Energy-efficient Wireless Sensor Network Topologies. J. Networks 4(6): 436-444 (2009) - [j6]Renato E. N. Moraes, Celso C. Ribeiro
Optimal solutions for fault-tolerant topology control in wireless ad hoc networks. IEEE Trans. Wirel. Commun. 8(12): 5970-5981 (2009) - 2008
- [j5]Jérôme Truffot, Christophe Duhamel
A Branch and Price algorithm for the k-splittable maximum flow problem. Discret. Optim. 5(3): 629-646 (2008) - [j4]Christophe Duhamel
Models and heuristics for a minimum arborescence problem. Networks 51(1): 34-47 (2008) - [c3]Andréa C. Santos, Christophe Duhamel
Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem. MCO 2008: 283-292 - [c2]Fatiha Bendali, Christophe Duhamel
An Optimization Approach for Designing Wireless Sensor Networks. NTMS 2008: 1-6 - 2007
- [j3]Christophe Duhamel
Multicommodity flow problems with a bounded number of paths: A flow deviation approach. Networks 49(1): 80-89 (2007) - [c1]Jérôme Truffot, Christophe Duhamel
k-splittable delay constrained routing problem: A branch and price approach. DRCN 2007: 1-8
1990 – 1999
- 1997
- [j2]Christophe Duhamel
A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows. Transp. Sci. 31(1): 49-59 (1997) - 1996
- [j1]Jean-Yves Potvin, Christophe Duhamel
A Genetic Algorithm for Vehicle Routing with Backhauling. Appl. Intell. 6(4): 345-355 (1996)
Coauthor Index
aka: Andréa Cynthia Santos
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-28 23:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: