On path ranking in time-dependent graphs
From MaRDI portal
Publication:2669544
DOI10.1016/j.cor.2021.105446OpenAlexW3085938759MaRDI QIDQ2669544
Emanuela Guerriero, Gianpaolo Ghiani, Tommaso Adamo
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.07588
Uses Software
Cites Work
- Unnamed Item
- A branch-and-cut algorithm for the profitable windy rural postman problem
- Time-dependent routing problems: a review
- Natural and extended formulations for the time-dependent traveling salesman problem
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- A classification of formulations for the (time-dependent) traveling salesman problem
- A branch-and-bound algorithm for the time-dependent rural postman problem
- An integer programming approach for the time-dependent traveling salesman problem with time windows
- The next wave in computing, optimization, and decision technologies. Papers from the ninth INFORMS Computing Society conference (ICS 2005), Annapolis, MD, USA, January 5--7, 2005.
- The time-dependent traveling salesman problem
- Vehicle dispatching with time-dependent travel times
- An enhanced lower bound for the time-dependent travelling salesman problem
- An integer programming approach for the Chinese postman problem with time-dependent travel time
- A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
- An integer programming approach for the time-dependent TSP
- Vehicle Routing
- An Integer Programming Approach for the Rural Postman Problem with Time Dependent Travel Times
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
- The moving-target traveling salesman problem
- Computational Complexity
- A Time-Dependent No-Overlap Constraint: Application to Urban Delivery Problems
This page was built for publication: On path ranking in time-dependent graphs
