Solving the Traveling Salesman Problem with release dates via branch and cut
Authors:
- Agustín MonteroAMAgustín Montero
- Isabel Méndez-DíazIMIsabel Méndez-Díaz
- Juan José Miranda-BrontJMJuan José Miranda-Bront
Open Access
- 20 November 2023
- journal article
- research article
- Published by Elsevier in EURO Journal on Transportation and Logistics
- Vol. 12
Abstract
No abstract availableKeywords
Funding Information
- Ministry of Science, ICT and Future Planning
- Fondo para la Investigación Científica y Tecnológica (PICT-2016-2677, PICT-2018-2961)
This publication has 13 references indexed in Scilit:
- Complexity of routing problems with release dates and deadlinesEuropean Journal of Operational Research, 2018
- The Vehicle Routing Problem with Release and Due DatesINFORMS Journal on Computing, 2017
- Integer programming formulations for the elementary shortest path problemEuropean Journal of Operational Research, 2016
- The Multi-Trip Vehicle Routing Problem with Time Windows and Release DatesTransportation Science, 2016
- Complexity of routing problems with release datesEuropean Journal of Operational Research, 2015
- An adaptive large neighborhood search for a vehicle routing problem with multiple routesComputers & Operations Research, 2014
- An exact algorithm for a vehicle routing problem with time windows and multiple use of vehiclesEuropean Journal of Operational Research, 2010
- A branch‐and‐cut algorithm for the undirected prize collecting traveling salesman problemNetworks, 2009
- An exact algorithm for a single-vehicle routing problem with time windows and multiple routesEuropean Journal of Operational Research, 2007
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window ConstraintsOperations Research, 1987