Recommendations
- THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
- Improved approximations for TSP with simple precedence constraints (extended abstract)
- Improved approximations for TSP with simple precedence constraints
- Improved approximations for ordered TSP on near-metric graphs
Cites work
- Competitive algorithms for server problems
- Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming
- HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIAL-A-RIDE PROBLEM
- scientific article; zbMATH DE number 3912104 (Why is no real title available?)
- scientific article; zbMATH DE number 192876 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1261809 (Why is no real title available?)
- scientific article; zbMATH DE number 1306870 (Why is no real title available?)
- Minimizing setups in ordered sets of fixed width
- On the approximation of shortest common supersequences and longest common subsequences
Cited in
(6)- Serving rides of equal importance for time-limited dial-a-ride
- An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers
- Improved approximations for ordered TSP on near-metric graphs (extended abstract)
- Improved approximations for TSP with simple precedence constraints
- Maximizing the number of rides served for time-limited Dial-a-Ride*
- A (3/2+1/e)-approximation algorithm for ordered TSP
This page was built for publication: Constrained TSP and low-power computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096929)
