Pages that link to "Item:Q1019743"
From MaRDI portal
The following pages link to Approximation hardness of deadline-TSP reoptimization (Q1019743):
Displaying 8 items.
- A note on the traveling salesman reoptimization problem under vertex insertion (Q483055) (← links)
- Reoptimization of the metric deadline TSP (Q2266941) (← links)
- The parameterized approximability of TSP with deadlines (Q2464332) (← links)
- Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines (Q3167642) (← links)
- New algorithms for Steiner tree reoptimization (Q5002685) (← links)
- Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem (Q6163623) (← links)
- Heuristic reoptimization of time-extended multi-robot task allocation problems (Q6566561) (← links)
- New algorithms for Steiner tree reoptimization (Q6586666) (← links)