TSP race: minimizing completion time in time-sensitive applications
From MaRDI portal
Publication:319282
DOI10.1016/J.EJOR.2014.12.022zbMATH Open1346.90696OpenAlexW2076598850MaRDI QIDQ319282FDOQ319282
Authors: Bahar Çavdar, Joel Sokol 
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.12.022
Recommendations
- An integer programming approach for the time-dependent TSP
- The parameterized approximability of TSP with deadlines
- Minimizing completion time for a class of scheduling problems
- Reoptimization of the metric deadline TSP
- Approximation algorithms for deadline-TSP and vehicle routing with time-windows
- Online and offline algorithms for the time-dependent TSP with time zones
- scientific article; zbMATH DE number 1839476
- The time-dependent quickest path problem: properties and bounds
- On the complexity of time-dependent shortest paths
- On the complexity of time-dependent shortest paths
Combinatorial optimization (90C27) Numerical methods for mathematical programming, optimization and variational techniques (65K99)
Cites Work
- Expanding neighborhood GRASP for the traveling salesman problem
- A survey of hard real-time scheduling for multiprocessor systems
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
- A method for solving traveling-salesman problems
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- Title not available (Why is that?)
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Algorithms for the on-line quota traveling salesman problem
- Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
- A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
- A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
- Efficient scheduling strategies for processing multiple divisible loads on bus networks
- Chained Lin-Kernighan for large traveling salesman problems
- A branch and bound algorithm for the multiple depot vehicle scheduling problem
- Title not available (Why is that?)
- An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
- Computing and Combinatorics
Uses Software
This page was built for publication: TSP race: minimizing completion time in time-sensitive applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319282)
