scientific article; zbMATH DE number 2202185
From MaRDI portal
Publication:5314401
Recommendations
- A new heuristic for the traveling salesman problem with time windows.
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows
- A general VNS heuristic for the traveling salesman problem with time windows
- A generalized insertion heuristic for the travelling salesman problem with time windows
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows
- An integer programming approach for the time-dependent traveling salesman problem with time windows
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
- scientific article; zbMATH DE number 5864729
Cited in
(7)- Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
- A new heuristic for the traveling salesman problem with time windows.
- scientific article; zbMATH DE number 5864729 (Why is no real title available?)
- scientific article; zbMATH DE number 947471 (Why is no real title available?)
- Heuristic approaches to minimize tour duration for the TSP with multiple time windows
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5314401)