Caroline Prodhon
According to our database1,
Caroline Prodhon
authored at least 41 papers
between 2006 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
A Fair Sharing Approach for Micro-Services Function Chains Placement in Ultra-Low Latency Services.
IEEE Trans. Netw. Serv. Manag., February, 2024
Proceedings of the Metaheuristics - 15th International Conference, 2024
2023
A Lightweight Heuristic for Micro-Services Placement and Chaining in Low Latency Services.
Proceedings of the 19th International Conference on Network and Service Management, 2023
2022
The Grey Zone Two-Echelon Vehicle Routing Problem with Customer-to-Parcel Locations and Low-Pollution Vehicles for Inner-City Logistics.
Proceedings of the Operations Research Proceedings 2022: Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), 2022
Leveraging Micro-Services for Ultra-Low Latency: An optimization Model for Service Function Chains Placement.
Proceedings of the 8th IEEE International Conference on Network Softwarization, 2022
2021
An iterated local search for the biomedical sample transportation problem with multiple and interdependent pickups.
J. Oper. Res. Soc., 2021
The electric location-routing problem with heterogeneous fleet: Formulation and Benders decomposition approach.
Comput. Oper. Res., 2021
2019
Bicriteria Vehicle Routing Problem with Preferences and Timing Constraints in Home Health Care Services.
Algorithms, 2019
2016
A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots.
Transp. Sci., 2016
A GRASP × ILS for the vehicle routing problem with time windows, synchronization and precedence constraints.
Expert Syst. Appl., 2016
2015
Int. Trans. Oper. Res., 2015
A Multi-Start Split based Path Relinking (MSSPR) approach for the vehicle routing problem with route balancing.
Eng. Appl. Artif. Intell., 2015
2014
GRASP for the Vehicle Routing Problem with Time Windows, synchronization and precedence constraints.
Proceedings of the IEEE 10th International Conference on Wireless and Mobile Computing, 2014
Proceedings of the ICORES 2014, 2014
Proceedings of the ICORES 2014, 2014
2013
Proceedings of the Hybrid Metaheuristics, 2013
Electron. Notes Discret. Math., 2013
2012
Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking.
Eur. J. Oper. Res., 2012
A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem.
Eng. Appl. Artif. Intell., 2012
A hybrid evolutionary local search with depth first search split procedure for the heterogeneous vehicle routing problems.
Eng. Appl. Artif. Intell., 2012
2011
Eur. J. Oper. Res., 2011
Comput. Oper. Res., 2011
Efficient frameworks for greedy split and new depth first search split procedures for routing problems.
Comput. Oper. Res., 2011
Comput. Oper. Res., 2011
2010
GRASP/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots.
Eng. Appl. Artif. Intell., 2010
Comput. Oper. Res., 2010
A Multi-Start Evolutionary Local Search for the Two-Echelon Location Routing Problem.
Proceedings of the Hybrid Metaheuristics - 7th International Workshop, 2010
2009
Bi-objective Optimization of the Plasmon-assisted Lithography - Design of Plasmonic Nanostructures.
Proceedings of the IJCCI 2009, 2009
Proceedings of the Hybrid Metaheuristics, 6th International Workshop, 2009
Proceedings of the Applications of Evolutionary Computing, 2009
2008
A Memetic Algorithm with Population Management (MA|PM) for the Periodic Location-Routing Problem.
Proceedings of the Hybrid Metaheuristics, 5th International Workshop, 2008
2007
Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic.
Transp. Sci., 2007
Annu. Rev. Control., 2007
Proceedings of the Operations Research, 2007
2006
Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem.
Ann. Oper. Res., 2006
Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking.
4OR, 2006
A Memetic Algorithm with Population Management (MA|PM) for the Capacitated Location-Routing Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2006