Claudia Archetti

Orcid: 0000-0002-3524-1600

According to our database1, Claudia Archetti authored at least 92 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A new formulation and a branch-and-cut algorithm for the set orienteering problem.
Eur. J. Oper. Res., April, 2024

On the zero-inventory-ordering policy in the inventory routing problem.
Eur. J. Oper. Res., February, 2024

2023
The inventory routing problem with split deliveries.
Networks, December, 2023

The generalized close enough traveling salesman problem.
Eur. J. Oper. Res., November, 2023

Mathematical programming formulations for the Collapsed k-Core Problem.
Eur. J. Oper. Res., November, 2023

The hazardous orienteering problem.
Networks, March, 2023

The benefit of complete trip information in free-floating carsharing systems.
EURO J. Transp. Logist., 2023

2022
Pickup and delivery problems with autonomous vehicles on rings.
Eur. J. Oper. Res., 2022

Inventory routing in a warehouse: The storage replenishment routing problem.
Eur. J. Oper. Res., 2022

Optimization in multimodal freight transportation problems: A Survey.
Eur. J. Oper. Res., 2022

Comparison of formulations for the Inventory Routing Problem.
Eur. J. Oper. Res., 2022

Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates.
CoRR, 2022

A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance.
Comput. Oper. Res., 2022

Crowdsourced humanitarian relief vehicle routing problem.
Comput. Oper. Res., 2022

The Heterogeneous Flexible Periodic Vehicle Routing Problem: Mathematical formulations and solution algorithms.
Comput. Oper. Res., 2022

A sequential approach for a multi-commodity two-echelon distribution problem.
Comput. Ind. Eng., 2022

2021
The Fixed-Partition Policy Inventory Routing Problem.
Transp. Sci., 2021

Recent challenges in Routing and Inventory Routing: E-commerce and last-mile delivery.
Networks, 2021

A kernel search heuristic for the multivehicle inventory routing problem.
Int. Trans. Oper. Res., 2021

The online vehicle routing problem with occasional drivers.
Comput. Oper. Res., 2021

A dynamic and probabilistic orienteering problem.
Comput. Oper. Res., 2021

The Bi-Objective Long-Haul Transportation Problem on a Road Network (Invited Talk).
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

Dynamic traveling salesman problem with stochastic release dates.
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

A matheuristic for the air transportation freight forwarder service problem.
Comput. Oper. Res., 2020

2019
Preface: Special issue on the future of route optimization/vehicle routing.
Networks, 2019

Flexible two-echelon location routing problem.
Eur. J. Oper. Res., 2019

Exact solution methods for the multi-period vehicle routing problem with due dates.
Comput. Oper. Res., 2019

2018
A simulation study of an on-demand transportation system.
Int. Trans. Oper. Res., 2018

Inventory routing with pickups and deliveries.
Eur. J. Oper. Res., 2018

The Set Orienteering Problem.
Eur. J. Oper. Res., 2018

Comparing sequential and integrated approaches for the production routing problem.
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

A two-phase solution algorithm for the Flexible Periodic Vehicle Routing Problem.
Comput. Oper. Res., 2018

2017
A Matheuristic for the Multivehicle Inventory Routing Problem.
INFORMS J. Comput., 2017

The Undirected Capacitated General Routing Problem with Profits.
Eur. J. Oper. Res., 2017

Minimizing the logistic ratio in the inventory routing problem.
EURO J. Transp. Logist., 2017

The Flexible Periodic Vehicle Routing Problem.
Comput. Oper. Res., 2017

The probabilistic orienteering problem.
Comput. Oper. Res., 2017

2016
Multicommodity vs. Single-Commodity Routing.
Transp. Sci., 2016

The inventory routing problem: the value of integration.
Int. Trans. Oper. Res., 2016

The Vehicle Routing Problem with Occasional Drivers.
Eur. J. Oper. Res., 2016

A branch-and-cut algorithm for the Orienteering Arc Routing Problem.
Comput. Oper. Res., 2016

2015
The Vehicle Routing Problem with Divisible Deliveries and Pickups.
Transp. Sci., 2015

A Two-Phase Iterative Heuristic Approach for the Production Routing Problem.
Transp. Sci., 2015

Complexity of routing problems with release dates.
Eur. J. Oper. Res., 2015

A matheuristic for the Team Orienteering Arc Routing Problem.
Eur. J. Oper. Res., 2015

Directed weighted improper coloring for cellular channel allocation.
Discret. Appl. Math., 2015

Multi-period Vehicle Routing Problem with Due dates.
Comput. Oper. Res., 2015

A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem.
Comput. Oper. Res., 2015

2014
The Team Orienteering Arc Routing Problem.
Transp. Sci., 2014

Incomplete service and split deliveries in a routing problem with profits.
Networks, 2014

The split delivery capacitated team orienteering problem.
Networks, 2014

Formulations for an inventory routing problem.
Int. Trans. Oper. Res., 2014

Branch-and-cut algorithms for the split delivery vehicle routing problem.
Eur. J. Oper. Res., 2014

Polynomial cases of the economic lot sizing problem with cost discounts.
Eur. J. Oper. Res., 2014

The directed profitable location Rural Postman Problem.
Eur. J. Oper. Res., 2014

The Clustered Orienteering Problem.
Eur. J. Oper. Res., 2014

A survey on matheuristics for routing problems.
EURO J. Comput. Optim., 2014

Special issue on: "matheuristics".
EURO J. Comput. Optim., 2014

An ILP-refined tabu search for the Directed Profitable Rural Postman Problem.
Discret. Appl. Math., 2014

A branch-and-price algorithm for the robust graph coloring problem.
Discret. Appl. Math., 2014

The Value Of Integration In Logistics.
Proceedings of the 28th European Conference on Modelling and Simulation, 2014

Vehicle Routing Problems with Profits.
Proceedings of the Vehicle Routing, 2014

2013
The capacitated team orienteering problem with incomplete service.
Optim. Lett., 2013

A heuristic algorithm for the free newspaper delivery problem.
Eur. J. Oper. Res., 2013

Optimal solutions for routing problems with profits.
Discret. Appl. Math., 2013

Reoptimizing the rural postman problem.
Comput. Oper. Res., 2013

2012
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks.
Networks, 2012

Vehicle routing problems with split deliveries.
Int. Trans. Oper. Res., 2012

A Hybrid Heuristic for an Inventory Routing Problem.
INFORMS J. Comput., 2012

Truck driver scheduling in Australia.
Comput. Oper. Res., 2012

2011
Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows.
Transp. Sci., 2011

A column generation approach for the split delivery vehicle routing problem.
Networks, 2011

Analysis of the maximum level policy in a production-distribution system.
Comput. Oper. Res., 2011

2010
Exact solutions to the double travelling salesman problem with multiple stacks.
Networks, 2010

Reoptimizing the 0-1 knapsack problem.
Discret. Appl. Math., 2010

The undirected capacitated arc routing problem with profits.
Comput. Oper. Res., 2010

2009
The Trip Scheduling Problem.
Transp. Sci., 2009

The capacitated team orienteering and profitable tour problems.
J. Oper. Res. Soc., 2009

2008
An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem.
Transp. Sci., 2008

Ants can solve the team orienteering problem.
Comput. Ind. Eng., 2008

2007
A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem.
Transp. Sci., 2007

Metaheuristics for the team orienteering problem.
J. Heuristics, 2007

2006
Worst-Case Analysis for Split Delivery Vehicle Routing Problems.
Transp. Sci., 2006

A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem.
Transp. Sci., 2006

An Overview on the Split Delivery Vehicle Routing Problem.
Proceedings of the Operations Research, 2006

2005
Complexity and Reducibility of the Skip Delivery Problem.
Transp. Sci., 2005

2004
Vehicle routing in the 1-skip collection problem.
J. Oper. Res. Soc., 2004

2003
Reoptimizing the traveling salesman problem.
Networks, 2003


  Loading...