TSP race: minimizing completion time in time-sensitive applications
From MaRDI portal
Publication:319282
DOI10.1016/j.ejor.2014.12.022zbMath1346.90696OpenAlexW2076598850MaRDI QIDQ319282
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
Combinatorial optimization (90C27) Numerical methods for mathematical programming, optimization and variational techniques (65K99)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Expanding neighborhood GRASP for the traveling salesman problem
- A survey of hard real-time scheduling for multiprocessor systems
- Chained Lin-Kernighan for Large Traveling Salesman Problems
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
- A branch and bound algorithm for the multiple depot vehicle scheduling problem
- An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
- A Method for Solving Traveling-Salesman Problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Computing and Combinatorics
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
This page was built for publication: TSP race: minimizing completion time in time-sensitive applications