Claudia Archetti
Orcid: 0000-0002-3524-1600Affiliations:
- ESSEC Business School, Cergy-Pontoise, France
According to our database1,
Claudia Archetti
authored at least 100 papers
between 2003 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2024
Eur. J. Oper. Res., April, 2024
Eur. J. Oper. Res., February, 2024
Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates.
Transp. Sci., 2024
Transp. Sci., 2024
Special Section on "DIMACS Implementation Challenge: Vehicle Routing" and "The EURO Meets NeurIPS 2022 Vehicle Routing Competition".
Transp. Sci., 2024
Eur. J. Oper. Res., 2024
Corrigendum to "A New Formulation and a Branch-and-Cut Algorithm for the Set Orienteering Problem" [European Journal of Operational Research, Volume 314, Issue 2, 16 April 2024, Pages 446-465].
Eur. J. Oper. Res., 2024
Integrating order picking and vehicle routing decisions in a dynamic e-commerce setting.
Comput. Oper. Res., 2024
A Triple Bottom Line optimization model for assignment and routing of on-demand home services.
Comput. Oper. Res., 2024
2023
Eur. J. Oper. Res., November, 2023
Eur. J. Oper. Res., November, 2023
EURO J. Transp. Logist., 2023
2022
Eur. J. Oper. Res., 2022
Eur. J. Oper. Res., 2022
Eur. J. Oper. Res., 2022
Eur. J. Oper. Res., 2022
A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance.
Comput. Oper. Res., 2022
The Heterogeneous Flexible Periodic Vehicle Routing Problem: Mathematical formulations and solution algorithms.
Comput. Oper. Res., 2022
Comput. Ind. Eng., 2022
2021
Recent challenges in Routing and Inventory Routing: E-commerce and last-mile delivery.
Networks, 2021
Int. Trans. Oper. Res., 2021
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021
2020
A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries.
Eur. J. Oper. Res., 2020
Eur. J. Oper. Res., 2020
Introduction to the special issue on combining optimization and machine learning: Application in vehicle routing, network design and crew scheduling.
EURO J. Transp. Logist., 2020
Comput. Oper. Res., 2020
2019
Networks, 2019
Comput. Oper. Res., 2019
2018
Int. Trans. Oper. Res., 2018
Eur. J. Oper. Res., 2018
Preface: Special Issue on the Ninth International Colloquium on Graphs and Optimization (GO IX), 2014.
Discret. Appl. Math., 2018
An iterated local search for the Traveling Salesman Problem with release dates and completion time minimization.
Comput. Oper. Res., 2018
Comput. Oper. Res., 2018
2017
INFORMS J. Comput., 2017
Eur. J. Oper. Res., 2017
EURO J. Transp. Logist., 2017
2016
Int. Trans. Oper. Res., 2016
Comput. Oper. Res., 2016
2015
Transp. Sci., 2015
Transp. Sci., 2015
Eur. J. Oper. Res., 2015
Discret. Appl. Math., 2015
A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem.
Comput. Oper. Res., 2015
2014
Networks, 2014
Eur. J. Oper. Res., 2014
Eur. J. Oper. Res., 2014
Discret. Appl. Math., 2014
Discret. Appl. Math., 2014
Proceedings of the 28th European Conference on Modelling and Simulation, 2014
2013
Optim. Lett., 2013
Eur. J. Oper. Res., 2013
2012
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks.
Networks, 2012
2011
Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows.
Transp. Sci., 2011
Networks, 2011
Comput. Oper. Res., 2011
2010
Networks, 2010
Comput. Oper. Res., 2010
2009
J. Oper. Res. Soc., 2009
2008
Transp. Sci., 2008
2007
Transp. Sci., 2007
2006
Transp. Sci., 2006
Proceedings of the Operations Research, 2006
2005
2004
2003