default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCaroline Prodhon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Hichem Magnouche
, Guillaume Doyen, Caroline Prodhon:
A Fair Sharing Approach for Micro-Services Function Chains Placement in Ultra-Low Latency Services. IEEE Trans. Netw. Serv. Manag. 21(1): 20-34 (2024)- [c14]Gérard Fleury, Philippe Lacomme, Caroline Prodhon:
Indirect Flow-Shop Coding Using Rank: Application to Indirect QAOA. MIC (1) 2024: 203-218 - 2023
- [c13]Hichem Magnouche, Guillaume Doyen, Caroline Prodhon:
A Lightweight Heuristic for Micro-Services Placement and Chaining in Low Latency Services. CNSM 2023: 1-9 - 2022
- [c12]Hichem Magnouche, Guillaume Doyen, Caroline Prodhon:
Leveraging Micro-Services for Ultra-Low Latency: An optimization Model for Service Function Chains Placement. NetSoft 2022: 198-206 - [c11]Edgar Ricardo Silva Russi, Nacima Labadie, Caroline Prodhon:
The Grey Zone Two-Echelon Vehicle Routing Problem with Customer-to-Parcel Locations and Low-Pollution Vehicles for Inner-City Logistics. OR 2022: 451-459 - 2021
- [j25]Hatice Çalik, Ammar Oulamara, Caroline Prodhon, Saïd Salhi:
The electric location-routing problem with heterogeneous fleet: Formulation and Benders decomposition approach. Comput. Oper. Res. 131: 105251 (2021) - [j24]Ana María Anaya-Arenas, Caroline Prodhon, Jacques Renaud, Angel B. Ruiz:
An iterated local search for the biomedical sample transportation problem with multiple and interdependent pickups. J. Oper. Res. Soc. 72(2): 367-382 (2021)
2010 – 2019
- 2019
- [j23]Syrine Roufaida Ait Haddadene, Nacima Labadie, Caroline Prodhon:
Bicriteria Vehicle Routing Problem with Preferences and Timing Constraints in Home Health Care Services. Algorithms 12(8): 152 (2019) - 2016
- [j22]Syrine Roufaida Ait Haddadene, Nacima Labadie, Caroline Prodhon:
A GRASP × ILS for the vehicle routing problem with time windows, synchronization and precedence constraints. Expert Syst. Appl. 66: 274-294 (2016) - [j21]José-Manuel Belenguer, Enrique Benavent, Antonio Martínez, Christian Prins, Caroline Prodhon, Juan G. Villegas:
A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots. Transp. Sci. 50(2): 735-749 (2016) - 2015
- [j20]Philippe Lacomme, Christian Prins, Caroline Prodhon, Libo Ren:
A Multi-Start Split based Path Relinking (MSSPR) approach for the vehicle routing problem with route balancing. Eng. Appl. Artif. Intell. 38: 237-251 (2015) - [j19]William J. Guerrero, Caroline Prodhon, Nubia Velasco, Ciro-Alberto Amaya:
A relax-and-price heuristic for the inventory-location-routing problem. Int. Trans. Oper. Res. 22(1): 129-148 (2015) - 2014
- [j18]Caroline Prodhon, Christian Prins:
A survey of recent research on location-routing problems. Eur. J. Oper. Res. 238(1): 1-17 (2014) - [c10]Philippe Lacomme, Caroline Prodhon, Christian Prins, Xavier Gandibleux, Boris Beillevaire, Libo Ren:
A Split based Approach for the Vehicle Routing Problem with Route Balancing. ICORES 2014: 159-166 - [c9]Birome Holo Ba, Christian Prins, Caroline Prodhon:
An Overview of OR Models for Biomass Supply Chains. ICORES 2014: 174-182 - [c8]Syrine Roufaida Ait Haddadene, Nacima Labadie, Caroline Prodhon:
GRASP for the Vehicle Routing Problem with Time Windows, synchronization and precedence constraints. WiMob 2014: 72-76 - 2013
- [j17]William J. Guerrero, Nubia Velasco, Caroline Prodhon, Ciro-Alberto Amaya:
On the Generalized Elementary Shortest Path Problem: A heuristic approach. Electron. Notes Discret. Math. 41: 503-510 (2013) - [j16]Juan G. Villegas, Christian Prins, Caroline Prodhon, Andrés L. Medaglia, Nubia Velasco:
A matheuristic for the truck and trailer routing problem. Eur. J. Oper. Res. 230(2): 231-244 (2013) - [p1]Christophe Duhamel, Christophe Gouinaud, Philippe Lacomme, Caroline Prodhon:
A Multi-thread GRASPxELS for the Heterogeneous Capacitated Vehicle Routing Problem. Hybrid Metaheuristics 2013: 237-269 - 2012
- [j15]Viet-Phuong Nguyen, Christian Prins, Caroline Prodhon:
A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem. Eng. Appl. Artif. Intell. 25(1): 56-71 (2012) - [j14]Christophe Duhamel, Philippe Lacomme, Caroline Prodhon:
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) - [j13]Viet-Phuong Nguyen, Christian Prins, Caroline Prodhon:
Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking. Eur. J. Oper. Res. 216(1): 113-126 (2012) - 2011
- [j12]Christophe Duhamel, Philippe Lacomme, Caroline Prodhon:
Efficient frameworks for greedy split and new depth first search split procedures for routing problems. Comput. Oper. Res. 38(4): 723-739 (2011) - [j11]José-Manuel Belenguer, Enrique Benavent, Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo:
A Branch-and-Cut method for the Capacitated Location-Routing Problem. Comput. Oper. Res. 38(6): 931-941 (2011) - [j10]Juan G. Villegas, Christian Prins, Caroline Prodhon, Andrés L. Medaglia, Nubia Velasco:
A GRASP with evolutionary path relinking for the truck and trailer routing problem. Comput. Oper. Res. 38(9): 1319-1334 (2011) - [j9]Caroline Prodhon:
A hybrid evolutionary algorithm for the periodic location-routing problem. Eur. J. Oper. Res. 210(2): 204-212 (2011) - 2010
- [j8]Christian Prins, Nacima Labadi, Caroline Prodhon, Roberto Wolfler Calvo:
Metaheuristics for logistics and vehicle routing. Comput. Oper. Res. 37(11): 1833-1834 (2010) - [j7]Christophe Duhamel, Philippe Lacomme, Christian Prins, Caroline Prodhon:
A GRASP×ELS approach for the capacitated location-routing problem. Comput. Oper. Res. 37(11): 1912-1923 (2010) - [j6]Juan G. Villegas, Christian Prins, Caroline Prodhon, Andrés L. Medaglia, Nubia Velasco:
GRASP/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots. Eng. Appl. Artif. Intell. 23(5): 780-794 (2010) - [c7]Viet-Phuong Nguyen, Christian Prins, Caroline Prodhon:
A Multi-Start Evolutionary Local Search for the Two-Echelon Location Routing Problem. Hybrid Metaheuristics 2010: 88-102
2000 – 2009
- 2009
- [c6]Caroline Prodhon, Demetrio Macías, Farouk Yalaoui, Alexandre Vial, Lionel Amodeo:
Evolutionary Optimization for Plasmon-Assisted Lithography. EvoWorkshops 2009: 420-425 - [c5]Caroline Prodhon:
An ELSxPath Relinking Hybrid for the Periodic Location-Routing Problem. Hybrid Metaheuristics 2009: 15-29 - [c4]Caroline Prodhon, Demetrio Macías, Farouk Yalaoui, Alexandre Vial, Lionel Amodeo:
Bi-objective Optimization of the Plasmon-assisted Lithography - Design of Plasmonic Nanostructures. IJCCI 2009: 306-309 - 2008
- [c3]Caroline Prodhon, Christian Prins:
A Memetic Algorithm with Population Management (MA|PM) for the Periodic Location-Routing Problem. Hybrid Metaheuristics 2008: 43-57 - 2007
- [j5]Caroline Prodhon:
Solving the capacitated location-routing problem. 4OR 5(4): 339-342 (2007) - [j4]Alexandre Dolgui, Caroline Prodhon:
Supply planning under uncertainties in MRP environments: A state of the art. Annu. Rev. Control. 31(2): 269-279 (2007) - [j3]Christian Prins, Caroline Prodhon, Angel B. Ruiz, Patrick Soriano, Roberto Wolfler Calvo:
Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic. Transp. Sci. 41(4): 470-483 (2007) - [c2]Caroline Prodhon:
A Metaheuristic for the Periodic Location-Routing Problem. OR 2007: 159-164 - 2006
- [j2]Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo:
Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR 4(3): 221-238 (2006) - [j1]Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo:
Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem. Ann. Oper. Res. 147(1): 23-41 (2006) - [c1]Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo:
A Memetic Algorithm with Population Management (MA|PM) for the Capacitated Location-Routing Problem. EvoCOP 2006: 183-194
Coauthor Index
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 2025-03-04 21:15 CET 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:
